<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type"
content="text/html;charset=iso-8859-1">
<title>ldns documentation</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<div class="logo">
<img src="LogoInGradientBar2-y100.png"/>
</div>
<!-- Generated by Doxygen 1.7.4 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="dirs.html"><span>Directories</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<div class="title">rbtree.c</div> </div>
</div>
<div class="contents">
<a href="rbtree_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * rbtree.c -- generic red black tree</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * Taken from Unbound, modified for ldns</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Copyright (c) 2001-2008, NLnet Labs. All rights reserved.</span>
<a name="l00007"></a>00007 <span class="comment"> * </span>
<a name="l00008"></a>00008 <span class="comment"> * This software is open source.</span>
<a name="l00009"></a>00009 <span class="comment"> * </span>
<a name="l00010"></a>00010 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00011"></a>00011 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00012"></a>00012 <span class="comment"> * are met:</span>
<a name="l00013"></a>00013 <span class="comment"> * </span>
<a name="l00014"></a>00014 <span class="comment"> * Redistributions of source code must retain the above copyright notice,</span>
<a name="l00015"></a>00015 <span class="comment"> * this list of conditions and the following disclaimer.</span>
<a name="l00016"></a>00016 <span class="comment"> * </span>
<a name="l00017"></a>00017 <span class="comment"> * Redistributions in binary form must reproduce the above copyright notice,</span>
<a name="l00018"></a>00018 <span class="comment"> * this list of conditions and the following disclaimer in the documentation</span>
<a name="l00019"></a>00019 <span class="comment"> * and/or other materials provided with the distribution.</span>
<a name="l00020"></a>00020 <span class="comment"> * </span>
<a name="l00021"></a>00021 <span class="comment"> * Neither the name of the NLNET LABS nor the names of its contributors may</span>
<a name="l00022"></a>00022 <span class="comment"> * be used to endorse or promote products derived from this software without</span>
<a name="l00023"></a>00023 <span class="comment"> * specific prior written permission.</span>
<a name="l00024"></a>00024 <span class="comment"> * </span>
<a name="l00025"></a>00025 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</span>
<a name="l00026"></a>00026 <span class="comment"> * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED</span>
<a name="l00027"></a>00027 <span class="comment"> * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00028"></a>00028 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE</span>
<a name="l00029"></a>00029 <span class="comment"> * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR</span>
<a name="l00030"></a>00030 <span class="comment"> * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF</span>
<a name="l00031"></a>00031 <span class="comment"> * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS</span>
<a name="l00032"></a>00032 <span class="comment"> * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN</span>
<a name="l00033"></a>00033 <span class="comment"> * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)</span>
<a name="l00034"></a>00034 <span class="comment"> * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE</span>
<a name="l00035"></a>00035 <span class="comment"> * POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00036"></a>00036 <span class="comment"> *</span>
<a name="l00037"></a>00037 <span class="comment"> */</span>
<a name="l00038"></a>00038
<a name="l00044"></a>00044 <span class="preprocessor">#include <<a class="code" href="ldns_2config_8h.html">ldns/config.h</a>></span>
<a name="l00045"></a>00045 <span class="preprocessor">#include <<a class="code" href="rbtree_8h.html" title="Red black tree.">ldns/rbtree.h</a>></span>
<a name="l00046"></a>00046 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00047"></a>00047
<a name="l00049"></a><a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6">00049</a> <span class="preprocessor">#define BLACK 0</span>
<a name="l00050"></a>00050 <span class="preprocessor"></span>
<a name="l00051"></a><a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f">00051</a> <span class="preprocessor">#define RED 1</span>
<a name="l00052"></a>00052 <span class="preprocessor"></span>
<a name="l00054"></a><a class="code" href="rbtree_8h.html#a9c65c464bbd4a3b574515a2547d3a268">00054</a> <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> <a class="code" href="rbtree_8c.html#a9c65c464bbd4a3b574515a2547d3a268" title="the NULL node, global alloc">ldns_rbtree_null_node</a> = {
<a name="l00055"></a>00055 <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>, <span class="comment">/* Parent. */</span>
<a name="l00056"></a>00056 <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>, <span class="comment">/* Left. */</span>
<a name="l00057"></a>00057 <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>, <span class="comment">/* Right. */</span>
<a name="l00058"></a>00058 NULL, <span class="comment">/* Key. */</span>
<a name="l00059"></a>00059 NULL, <span class="comment">/* Data. */</span>
<a name="l00060"></a>00060 <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a> <span class="comment">/* Color. */</span>
<a name="l00061"></a>00061 };
<a name="l00062"></a>00062
<a name="l00064"></a>00064 <span class="keyword">static</span> <span class="keywordtype">void</span> ldns_rbtree_rotate_left(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node);
<a name="l00066"></a>00066 <span class="keyword">static</span> <span class="keywordtype">void</span> ldns_rbtree_rotate_right(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node);
<a name="l00068"></a>00068 <span class="keyword">static</span> <span class="keywordtype">void</span> ldns_rbtree_insert_fixup(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node);
<a name="l00070"></a>00070 <span class="keyword">static</span> <span class="keywordtype">void</span> ldns_rbtree_delete_fixup(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a>* rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* child, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* child_parent);
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="comment">/*</span>
<a name="l00073"></a>00073 <span class="comment"> * Creates a new red black tree, intializes and returns a pointer to it.</span>
<a name="l00074"></a>00074 <span class="comment"> *</span>
<a name="l00075"></a>00075 <span class="comment"> * Return NULL on failure.</span>
<a name="l00076"></a>00076 <span class="comment"> *</span>
<a name="l00077"></a>00077 <span class="comment"> */</span>
<a name="l00078"></a>00078 <a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *
<a name="l00079"></a><a class="code" href="rbtree_8h.html#a1319e3ff5b8355d6e1e7b65554bc854d">00079</a> <a class="code" href="rbtree_8c.html#a1319e3ff5b8355d6e1e7b65554bc854d" title="Create new tree (malloced) with given key compare function.">ldns_rbtree_create</a> (<span class="keywordtype">int</span> (*cmpf)(<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *))
<a name="l00080"></a>00080 {
<a name="l00081"></a>00081 <a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree;
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="comment">/* Allocate memory for it */</span>
<a name="l00084"></a>00084 rbtree = (<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *) malloc(<span class="keyword">sizeof</span>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a>));
<a name="l00085"></a>00085 <span class="keywordflow">if</span> (!rbtree) {
<a name="l00086"></a>00086 <span class="keywordflow">return</span> NULL;
<a name="l00087"></a>00087 }
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="comment">/* Initialize it */</span>
<a name="l00090"></a>00090 <a class="code" href="rbtree_8c.html#abfc60e1266fe66bda7d3fd7305787401" title="Init a new tree (malloced by caller) with given key compare function.">ldns_rbtree_init</a>(rbtree, cmpf);
<a name="l00091"></a>00091
<a name="l00092"></a>00092 <span class="keywordflow">return</span> rbtree;
<a name="l00093"></a>00093 }
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="keywordtype">void</span>
<a name="l00096"></a><a class="code" href="rbtree_8h.html#abfc60e1266fe66bda7d3fd7305787401">00096</a> <a class="code" href="rbtree_8c.html#abfc60e1266fe66bda7d3fd7305787401" title="Init a new tree (malloced by caller) with given key compare function.">ldns_rbtree_init</a>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <span class="keywordtype">int</span> (*cmpf)(<span class="keyword">const</span> <span class="keywordtype">void</span> *, <span class="keyword">const</span> <span class="keywordtype">void</span> *))
<a name="l00097"></a>00097 {
<a name="l00098"></a>00098 <span class="comment">/* Initialize it */</span>
<a name="l00099"></a>00099 rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> = <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00100"></a>00100 rbtree-><a class="code" href="structldns__rbtree__t.html#aab8a0fa563b0fe3cf66e0ecafd95e217" title="The number of the nodes in the tree.">count</a> = 0;
<a name="l00101"></a>00101 rbtree-><a class="code" href="structldns__rbtree__t.html#ab8821c5723a7ac7304bc8f3d225395be" title="Key compare function.">cmp</a> = cmpf;
<a name="l00102"></a>00102 }
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="keywordtype">void</span>
<a name="l00105"></a><a class="code" href="rbtree_8h.html#a3762aeeab2725b04a9e0dfaf817c062f">00105</a> <a class="code" href="rbtree_8c.html#a3762aeeab2725b04a9e0dfaf817c062f" title="Free the complete tree (but not its keys)">ldns_rbtree_free</a>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree)
<a name="l00106"></a>00106 {
<a name="l00107"></a>00107 free(rbtree);
<a name="l00108"></a>00108 }
<a name="l00109"></a>00109
<a name="l00110"></a>00110 <span class="comment">/*</span>
<a name="l00111"></a>00111 <span class="comment"> * Rotates the node to the left.</span>
<a name="l00112"></a>00112 <span class="comment"> *</span>
<a name="l00113"></a>00113 <span class="comment"> */</span>
<a name="l00114"></a>00114 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00115"></a>00115 ldns_rbtree_rotate_left(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node)
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *right = node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00118"></a>00118 node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = right-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00119"></a>00119 <span class="keywordflow">if</span> (right-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00120"></a>00120 right-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = node;
<a name="l00121"></a>00121
<a name="l00122"></a>00122 right-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <span class="keywordflow">if</span> (node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00125"></a>00125 <span class="keywordflow">if</span> (node == node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>) {
<a name="l00126"></a>00126 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = right;
<a name="l00127"></a>00127 } <span class="keywordflow">else</span> {
<a name="l00128"></a>00128 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = right;
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130 } <span class="keywordflow">else</span> {
<a name="l00131"></a>00131 rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> = right;
<a name="l00132"></a>00132 }
<a name="l00133"></a>00133 right-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = node;
<a name="l00134"></a>00134 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = right;
<a name="l00135"></a>00135 }
<a name="l00136"></a>00136
<a name="l00137"></a>00137 <span class="comment">/*</span>
<a name="l00138"></a>00138 <span class="comment"> * Rotates the node to the right.</span>
<a name="l00139"></a>00139 <span class="comment"> *</span>
<a name="l00140"></a>00140 <span class="comment"> */</span>
<a name="l00141"></a>00141 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00142"></a>00142 ldns_rbtree_rotate_right(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node)
<a name="l00143"></a>00143 {
<a name="l00144"></a>00144 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *left = node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00145"></a>00145 node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = left-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00146"></a>00146 <span class="keywordflow">if</span> (left-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00147"></a>00147 left-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = node;
<a name="l00148"></a>00148
<a name="l00149"></a>00149 left-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="keywordflow">if</span> (node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00152"></a>00152 <span class="keywordflow">if</span> (node == node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>) {
<a name="l00153"></a>00153 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = left;
<a name="l00154"></a>00154 } <span class="keywordflow">else</span> {
<a name="l00155"></a>00155 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = left;
<a name="l00156"></a>00156 }
<a name="l00157"></a>00157 } <span class="keywordflow">else</span> {
<a name="l00158"></a>00158 rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> = left;
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160 left-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = node;
<a name="l00161"></a>00161 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = left;
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00165"></a>00165 ldns_rbtree_insert_fixup(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node)
<a name="l00166"></a>00166 {
<a name="l00167"></a>00167 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *uncle;
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <span class="comment">/* While not at the root and need fixing... */</span>
<a name="l00170"></a>00170 <span class="keywordflow">while</span> (node != rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> && node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>) {
<a name="l00171"></a>00171 <span class="comment">/* If our parent is left child of our grandparent... */</span>
<a name="l00172"></a>00172 <span class="keywordflow">if</span> (node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> == node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>) {
<a name="l00173"></a>00173 uncle = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="comment">/* If our uncle is red... */</span>
<a name="l00176"></a>00176 <span class="keywordflow">if</span> (uncle-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>) {
<a name="l00177"></a>00177 <span class="comment">/* Paint the parent and the uncle black... */</span>
<a name="l00178"></a>00178 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00179"></a>00179 uncle-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="comment">/* And the grandparent red... */</span>
<a name="l00182"></a>00182 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00183"></a>00183
<a name="l00184"></a>00184 <span class="comment">/* And continue fixing the grandparent */</span>
<a name="l00185"></a>00185 node = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00186"></a>00186 } <span class="keywordflow">else</span> { <span class="comment">/* Our uncle is black... */</span>
<a name="l00187"></a>00187 <span class="comment">/* Are we the right child? */</span>
<a name="l00188"></a>00188 <span class="keywordflow">if</span> (node == node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>) {
<a name="l00189"></a>00189 node = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00190"></a>00190 ldns_rbtree_rotate_left(rbtree, node);
<a name="l00191"></a>00191 }
<a name="l00192"></a>00192 <span class="comment">/* Now we're the left child, repaint and rotate... */</span>
<a name="l00193"></a>00193 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00194"></a>00194 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00195"></a>00195 ldns_rbtree_rotate_right(rbtree, node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>);
<a name="l00196"></a>00196 }
<a name="l00197"></a>00197 } <span class="keywordflow">else</span> {
<a name="l00198"></a>00198 uncle = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <span class="comment">/* If our uncle is red... */</span>
<a name="l00201"></a>00201 <span class="keywordflow">if</span> (uncle-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>) {
<a name="l00202"></a>00202 <span class="comment">/* Paint the parent and the uncle black... */</span>
<a name="l00203"></a>00203 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00204"></a>00204 uncle-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <span class="comment">/* And the grandparent red... */</span>
<a name="l00207"></a>00207 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00208"></a>00208
<a name="l00209"></a>00209 <span class="comment">/* And continue fixing the grandparent */</span>
<a name="l00210"></a>00210 node = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00211"></a>00211 } <span class="keywordflow">else</span> { <span class="comment">/* Our uncle is black... */</span>
<a name="l00212"></a>00212 <span class="comment">/* Are we the right child? */</span>
<a name="l00213"></a>00213 <span class="keywordflow">if</span> (node == node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>) {
<a name="l00214"></a>00214 node = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00215"></a>00215 ldns_rbtree_rotate_right(rbtree, node);
<a name="l00216"></a>00216 }
<a name="l00217"></a>00217 <span class="comment">/* Now we're the right child, repaint and rotate... */</span>
<a name="l00218"></a>00218 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00219"></a>00219 node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00220"></a>00220 ldns_rbtree_rotate_left(rbtree, node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>);
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222 }
<a name="l00223"></a>00223 }
<a name="l00224"></a>00224 rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00225"></a>00225 }
<a name="l00226"></a>00226
<a name="l00227"></a>00227 <span class="keywordtype">void</span>
<a name="l00228"></a><a class="code" href="rbtree_8h.html#a7cfa1759127e6133df02b04731b05dc9">00228</a> <a class="code" href="rbtree_8c.html#a7cfa1759127e6133df02b04731b05dc9" title="Insert data into the tree (reversed arguments, for use as callback)">ldns_rbtree_insert_vref</a>(<a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *data, <span class="keywordtype">void</span> *rbtree)
<a name="l00229"></a>00229 {
<a name="l00230"></a>00230 (void) <a class="code" href="rbtree_8c.html#af7453903aed843b18ec24de879faf98f" title="Insert data into the tree.">ldns_rbtree_insert</a>((<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *) rbtree,
<a name="l00231"></a>00231 data);
<a name="l00232"></a>00232 }
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <span class="comment">/*</span>
<a name="l00235"></a>00235 <span class="comment"> * Inserts a node into a red black tree.</span>
<a name="l00236"></a>00236 <span class="comment"> *</span>
<a name="l00237"></a>00237 <span class="comment"> * Returns NULL on failure or the pointer to the newly added node</span>
<a name="l00238"></a>00238 <span class="comment"> * otherwise.</span>
<a name="l00239"></a>00239 <span class="comment"> */</span>
<a name="l00240"></a>00240 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *
<a name="l00241"></a><a class="code" href="rbtree_8h.html#af7453903aed843b18ec24de879faf98f">00241</a> <a class="code" href="rbtree_8c.html#af7453903aed843b18ec24de879faf98f" title="Insert data into the tree.">ldns_rbtree_insert</a> (<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *data)
<a name="l00242"></a>00242 {
<a name="l00243"></a>00243 <span class="comment">/* XXX Not necessary, but keeps compiler quiet... */</span>
<a name="l00244"></a>00244 <span class="keywordtype">int</span> r = 0;
<a name="l00245"></a>00245
<a name="l00246"></a>00246 <span class="comment">/* We start at the root of the tree */</span>
<a name="l00247"></a>00247 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node = rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>;
<a name="l00248"></a>00248 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *parent = <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00249"></a>00249
<a name="l00250"></a>00250 <span class="comment">/* Lets find the new parent... */</span>
<a name="l00251"></a>00251 <span class="keywordflow">while</span> (node != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00252"></a>00252 <span class="comment">/* Compare two keys, do we have a duplicate? */</span>
<a name="l00253"></a>00253 <span class="keywordflow">if</span> ((r = rbtree-><a class="code" href="structldns__rbtree__t.html#ab8821c5723a7ac7304bc8f3d225395be" title="Key compare function.">cmp</a>(data-><a class="code" href="structldns__rbnode__t.html#ad6646f5af0664e6ddedbf78b9deed2dc" title="pointer to sorting key">key</a>, node-><a class="code" href="structldns__rbnode__t.html#ad6646f5af0664e6ddedbf78b9deed2dc" title="pointer to sorting key">key</a>)) == 0) {
<a name="l00254"></a>00254 <span class="keywordflow">return</span> NULL;
<a name="l00255"></a>00255 }
<a name="l00256"></a>00256 parent = node;
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="keywordflow">if</span> (r < 0) {
<a name="l00259"></a>00259 node = node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00260"></a>00260 } <span class="keywordflow">else</span> {
<a name="l00261"></a>00261 node = node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00262"></a>00262 }
<a name="l00263"></a>00263 }
<a name="l00264"></a>00264
<a name="l00265"></a>00265 <span class="comment">/* Initialize the new node */</span>
<a name="l00266"></a>00266 data-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = parent;
<a name="l00267"></a>00267 data-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = data-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00268"></a>00268 data-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00269"></a>00269 rbtree-><a class="code" href="structldns__rbtree__t.html#aab8a0fa563b0fe3cf66e0ecafd95e217" title="The number of the nodes in the tree.">count</a>++;
<a name="l00270"></a>00270
<a name="l00271"></a>00271 <span class="comment">/* Insert it into the tree... */</span>
<a name="l00272"></a>00272 <span class="keywordflow">if</span> (parent != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00273"></a>00273 <span class="keywordflow">if</span> (r < 0) {
<a name="l00274"></a>00274 parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = data;
<a name="l00275"></a>00275 } <span class="keywordflow">else</span> {
<a name="l00276"></a>00276 parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = data;
<a name="l00277"></a>00277 }
<a name="l00278"></a>00278 } <span class="keywordflow">else</span> {
<a name="l00279"></a>00279 rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> = data;
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281
<a name="l00282"></a>00282 <span class="comment">/* Fix up the red-black properties... */</span>
<a name="l00283"></a>00283 ldns_rbtree_insert_fixup(rbtree, data);
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <span class="keywordflow">return</span> data;
<a name="l00286"></a>00286 }
<a name="l00287"></a>00287
<a name="l00288"></a>00288 <span class="comment">/*</span>
<a name="l00289"></a>00289 <span class="comment"> * Searches the red black tree, returns the data if key is found or NULL otherwise.</span>
<a name="l00290"></a>00290 <span class="comment"> *</span>
<a name="l00291"></a>00291 <span class="comment"> */</span>
<a name="l00292"></a>00292 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *
<a name="l00293"></a><a class="code" href="rbtree_8h.html#ab95e41509757f1f9652011ce18475d5a">00293</a> <a class="code" href="rbtree_8c.html#ab95e41509757f1f9652011ce18475d5a" title="Find key in tree.">ldns_rbtree_search</a> (<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <span class="keyword">const</span> <span class="keywordtype">void</span> *key)
<a name="l00294"></a>00294 {
<a name="l00295"></a>00295 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node;
<a name="l00296"></a>00296
<a name="l00297"></a>00297 <span class="keywordflow">if</span> (<a class="code" href="rbtree_8c.html#aaf5f35e7648861e0d1006f5de1199b14" title="Find, but match does not have to be exact.">ldns_rbtree_find_less_equal</a>(rbtree, key, &node)) {
<a name="l00298"></a>00298 <span class="keywordflow">return</span> node;
<a name="l00299"></a>00299 } <span class="keywordflow">else</span> {
<a name="l00300"></a>00300 <span class="keywordflow">return</span> NULL;
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303
<a name="l00305"></a>00305 <span class="keyword">static</span> <span class="keywordtype">void</span> swap_int8(uint8_t* x, uint8_t* y)
<a name="l00306"></a>00306 {
<a name="l00307"></a>00307 uint8_t t = *x; *x = *y; *y = t;
<a name="l00308"></a>00308 }
<a name="l00309"></a>00309
<a name="l00311"></a>00311 <span class="keyword">static</span> <span class="keywordtype">void</span> swap_np(<a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>** x, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>** y)
<a name="l00312"></a>00312 {
<a name="l00313"></a>00313 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* t = *x; *x = *y; *y = t;
<a name="l00314"></a>00314 }
<a name="l00315"></a>00315
<a name="l00317"></a>00317 <span class="keyword">static</span> <span class="keywordtype">void</span> change_parent_ptr(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a>* rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* parent, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* old, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* <span class="keyword">new</span>)
<a name="l00318"></a>00318 {
<a name="l00319"></a>00319 <span class="keywordflow">if</span>(parent == <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00320"></a>00320 {
<a name="l00321"></a>00321 <span class="keywordflow">if</span>(rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> == old) rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> = <span class="keyword">new</span>;
<a name="l00322"></a>00322 <span class="keywordflow">return</span>;
<a name="l00323"></a>00323 }
<a name="l00324"></a>00324 <span class="keywordflow">if</span>(parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> == old) parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = <span class="keyword">new</span>;
<a name="l00325"></a>00325 <span class="keywordflow">if</span>(parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == old) parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = <span class="keyword">new</span>;
<a name="l00326"></a>00326 }
<a name="l00328"></a>00328 <span class="keyword">static</span> <span class="keywordtype">void</span> change_child_ptr(<a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* child, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* old, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* <span class="keyword">new</span>)
<a name="l00329"></a>00329 {
<a name="l00330"></a>00330 <span class="keywordflow">if</span>(child == <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) <span class="keywordflow">return</span>;
<a name="l00331"></a>00331 <span class="keywordflow">if</span>(child-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> == old) child-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = <span class="keyword">new</span>;
<a name="l00332"></a>00332 }
<a name="l00333"></a>00333
<a name="l00334"></a>00334 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>*
<a name="l00335"></a><a class="code" href="rbtree_8h.html#ab6d2736cd058aaee5af1bf4d59265764">00335</a> <a class="code" href="rbtree_8c.html#ab6d2736cd058aaee5af1bf4d59265764" title="Delete element from tree.">ldns_rbtree_delete</a>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <span class="keyword">const</span> <span class="keywordtype">void</span> *key)
<a name="l00336"></a>00336 {
<a name="l00337"></a>00337 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *to_delete;
<a name="l00338"></a>00338 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *child;
<a name="l00339"></a>00339 <span class="keywordflow">if</span>((to_delete = <a class="code" href="rbtree_8c.html#ab95e41509757f1f9652011ce18475d5a" title="Find key in tree.">ldns_rbtree_search</a>(rbtree, key)) == 0) <span class="keywordflow">return</span> 0;
<a name="l00340"></a>00340 rbtree-><a class="code" href="structldns__rbtree__t.html#aab8a0fa563b0fe3cf66e0ecafd95e217" title="The number of the nodes in the tree.">count</a>--;
<a name="l00341"></a>00341
<a name="l00342"></a>00342 <span class="comment">/* make sure we have at most one non-leaf child */</span>
<a name="l00343"></a>00343 <span class="keywordflow">if</span>(to_delete-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a> &&
<a name="l00344"></a>00344 to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00345"></a>00345 {
<a name="l00346"></a>00346 <span class="comment">/* swap with smallest from right subtree (or largest from left) */</span>
<a name="l00347"></a>00347 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *smright = to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00348"></a>00348 <span class="keywordflow">while</span>(smright-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00349"></a>00349 smright = smright-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00350"></a>00350 <span class="comment">/* swap the smright and to_delete elements in the tree,</span>
<a name="l00351"></a>00351 <span class="comment"> * but the ldns_rbnode_t is first part of user data struct</span>
<a name="l00352"></a>00352 <span class="comment"> * so cannot just swap the keys and data pointers. Instead</span>
<a name="l00353"></a>00353 <span class="comment"> * readjust the pointers left,right,parent */</span>
<a name="l00354"></a>00354
<a name="l00355"></a>00355 <span class="comment">/* swap colors - colors are tied to the position in the tree */</span>
<a name="l00356"></a>00356 swap_int8(&to_delete-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a>, &smright-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a>);
<a name="l00357"></a>00357
<a name="l00358"></a>00358 <span class="comment">/* swap child pointers in parents of smright/to_delete */</span>
<a name="l00359"></a>00359 change_parent_ptr(rbtree, to_delete-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>, to_delete, smright);
<a name="l00360"></a>00360 <span class="keywordflow">if</span>(to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> != smright)
<a name="l00361"></a>00361 change_parent_ptr(rbtree, smright-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>, smright, to_delete);
<a name="l00362"></a>00362
<a name="l00363"></a>00363 <span class="comment">/* swap parent pointers in children of smright/to_delete */</span>
<a name="l00364"></a>00364 change_child_ptr(smright-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>, smright, to_delete);
<a name="l00365"></a>00365 change_child_ptr(smright-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>, smright, to_delete);
<a name="l00366"></a>00366 change_child_ptr(smright-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>, smright, to_delete);
<a name="l00367"></a>00367 change_child_ptr(smright-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>, smright, to_delete);
<a name="l00368"></a>00368 change_child_ptr(to_delete-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>, to_delete, smright);
<a name="l00369"></a>00369 <span class="keywordflow">if</span>(to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> != smright)
<a name="l00370"></a>00370 change_child_ptr(to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>, to_delete, smright);
<a name="l00371"></a>00371 <span class="keywordflow">if</span>(to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == smright)
<a name="l00372"></a>00372 {
<a name="l00373"></a>00373 <span class="comment">/* set up so after swap they work */</span>
<a name="l00374"></a>00374 to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = to_delete;
<a name="l00375"></a>00375 smright-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = smright;
<a name="l00376"></a>00376 }
<a name="l00377"></a>00377
<a name="l00378"></a>00378 <span class="comment">/* swap pointers in to_delete/smright nodes */</span>
<a name="l00379"></a>00379 swap_np(&to_delete-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>, &smright-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>);
<a name="l00380"></a>00380 swap_np(&to_delete-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>, &smright-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>);
<a name="l00381"></a>00381 swap_np(&to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>, &smright-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>);
<a name="l00382"></a>00382
<a name="l00383"></a>00383 <span class="comment">/* now delete to_delete (which is at the location where the smright previously was) */</span>
<a name="l00384"></a>00384 }
<a name="l00385"></a>00385
<a name="l00386"></a>00386 <span class="keywordflow">if</span>(to_delete-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) child = to_delete-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00387"></a>00387 <span class="keywordflow">else</span> child = to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00388"></a>00388
<a name="l00389"></a>00389 <span class="comment">/* unlink to_delete from the tree, replace to_delete with child */</span>
<a name="l00390"></a>00390 change_parent_ptr(rbtree, to_delete-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>, to_delete, child);
<a name="l00391"></a>00391 change_child_ptr(child, to_delete, to_delete-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>);
<a name="l00392"></a>00392
<a name="l00393"></a>00393 <span class="keywordflow">if</span>(to_delete-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>)
<a name="l00394"></a>00394 {
<a name="l00395"></a>00395 <span class="comment">/* if node is red then the child (black) can be swapped in */</span>
<a name="l00396"></a>00396 }
<a name="l00397"></a>00397 <span class="keywordflow">else</span> <span class="keywordflow">if</span>(child-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>)
<a name="l00398"></a>00398 {
<a name="l00399"></a>00399 <span class="comment">/* change child to BLACK, removing a RED node is no problem */</span>
<a name="l00400"></a>00400 <span class="keywordflow">if</span>(child!=<a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) child-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00401"></a>00401 }
<a name="l00402"></a>00402 <span class="keywordflow">else</span> ldns_rbtree_delete_fixup(rbtree, child, to_delete-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>);
<a name="l00403"></a>00403
<a name="l00404"></a>00404 <span class="comment">/* unlink completely */</span>
<a name="l00405"></a>00405 to_delete-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a> = <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00406"></a>00406 to_delete-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> = <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00407"></a>00407 to_delete-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> = <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00408"></a>00408 to_delete-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00409"></a>00409 <span class="keywordflow">return</span> to_delete;
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411
<a name="l00412"></a>00412 <span class="keyword">static</span> <span class="keywordtype">void</span> ldns_rbtree_delete_fixup(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a>* rbtree, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* child, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* child_parent)
<a name="l00413"></a>00413 {
<a name="l00414"></a>00414 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* sibling;
<a name="l00415"></a>00415 <span class="keywordtype">int</span> go_up = 1;
<a name="l00416"></a>00416
<a name="l00417"></a>00417 <span class="comment">/* determine sibling to the node that is one-black short */</span>
<a name="l00418"></a>00418 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child) sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00419"></a>00419 <span class="keywordflow">else</span> sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00420"></a>00420
<a name="l00421"></a>00421 <span class="keywordflow">while</span>(go_up)
<a name="l00422"></a>00422 {
<a name="l00423"></a>00423 <span class="keywordflow">if</span>(child_parent == <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00424"></a>00424 {
<a name="l00425"></a>00425 <span class="comment">/* removed parent==black from root, every path, so ok */</span>
<a name="l00426"></a>00426 <span class="keywordflow">return</span>;
<a name="l00427"></a>00427 }
<a name="l00428"></a>00428
<a name="l00429"></a>00429 <span class="keywordflow">if</span>(sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>)
<a name="l00430"></a>00430 { <span class="comment">/* rotate to get a black sibling */</span>
<a name="l00431"></a>00431 child_parent-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00432"></a>00432 sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00433"></a>00433 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child)
<a name="l00434"></a>00434 ldns_rbtree_rotate_right(rbtree, child_parent);
<a name="l00435"></a>00435 <span class="keywordflow">else</span> ldns_rbtree_rotate_left(rbtree, child_parent);
<a name="l00436"></a>00436 <span class="comment">/* new sibling after rotation */</span>
<a name="l00437"></a>00437 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child) sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00438"></a>00438 <span class="keywordflow">else</span> sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00439"></a>00439 }
<a name="l00440"></a>00440
<a name="l00441"></a>00441 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>
<a name="l00442"></a>00442 && sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>
<a name="l00443"></a>00443 && sibling-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>
<a name="l00444"></a>00444 && sibling-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>)
<a name="l00445"></a>00445 { <span class="comment">/* fixup local with recolor of sibling */</span>
<a name="l00446"></a>00446 <span class="keywordflow">if</span>(sibling != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00447"></a>00447 sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00448"></a>00448
<a name="l00449"></a>00449 child = child_parent;
<a name="l00450"></a>00450 child_parent = child_parent-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00451"></a>00451 <span class="comment">/* prepare to go up, new sibling */</span>
<a name="l00452"></a>00452 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child) sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00453"></a>00453 <span class="keywordflow">else</span> sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00454"></a>00454 }
<a name="l00455"></a>00455 <span class="keywordflow">else</span> go_up = 0;
<a name="l00456"></a>00456 }
<a name="l00457"></a>00457
<a name="l00458"></a>00458 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>
<a name="l00459"></a>00459 && sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>
<a name="l00460"></a>00460 && sibling-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>
<a name="l00461"></a>00461 && sibling-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>)
<a name="l00462"></a>00462 {
<a name="l00463"></a>00463 <span class="comment">/* move red to sibling to rebalance */</span>
<a name="l00464"></a>00464 <span class="keywordflow">if</span>(sibling != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00465"></a>00465 sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00466"></a>00466 child_parent-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00467"></a>00467 <span class="keywordflow">return</span>;
<a name="l00468"></a>00468 }
<a name="l00469"></a>00469
<a name="l00470"></a>00470 <span class="comment">/* get a new sibling, by rotating at sibling. See which child</span>
<a name="l00471"></a>00471 <span class="comment"> of sibling is red */</span>
<a name="l00472"></a>00472 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child
<a name="l00473"></a>00473 && sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>
<a name="l00474"></a>00474 && sibling-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>
<a name="l00475"></a>00475 && sibling-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>)
<a name="l00476"></a>00476 {
<a name="l00477"></a>00477 sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00478"></a>00478 sibling-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00479"></a>00479 ldns_rbtree_rotate_left(rbtree, sibling);
<a name="l00480"></a>00480 <span class="comment">/* new sibling after rotation */</span>
<a name="l00481"></a>00481 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child) sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00482"></a>00482 <span class="keywordflow">else</span> sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00483"></a>00483 }
<a name="l00484"></a>00484 <span class="keywordflow">else</span> <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> == child
<a name="l00485"></a>00485 && sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>
<a name="l00486"></a>00486 && sibling-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>
<a name="l00487"></a>00487 && sibling-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> == <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>)
<a name="l00488"></a>00488 {
<a name="l00489"></a>00489 sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a8d23feea868a983c8c2b661e1e16972f" title="Node colour red.">RED</a>;
<a name="l00490"></a>00490 sibling-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00491"></a>00491 ldns_rbtree_rotate_right(rbtree, sibling);
<a name="l00492"></a>00492 <span class="comment">/* new sibling after rotation */</span>
<a name="l00493"></a>00493 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child) sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00494"></a>00494 <span class="keywordflow">else</span> sibling = child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00495"></a>00495 }
<a name="l00496"></a>00496
<a name="l00497"></a>00497 <span class="comment">/* now we have a black sibling with a red child. rotate and exchange colors. */</span>
<a name="l00498"></a>00498 sibling-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = child_parent-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a>;
<a name="l00499"></a>00499 child_parent-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00500"></a>00500 <span class="keywordflow">if</span>(child_parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> == child)
<a name="l00501"></a>00501 {
<a name="l00502"></a>00502 sibling-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00503"></a>00503 ldns_rbtree_rotate_right(rbtree, child_parent);
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505 <span class="keywordflow">else</span>
<a name="l00506"></a>00506 {
<a name="l00507"></a>00507 sibling-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>-><a class="code" href="structldns__rbnode__t.html#af9a5631a7bae634d6f983307c406624a" title="colour of this node">color</a> = <a class="code" href="rbtree_8c.html#a7b3b25cba33b07c303f3060fe41887f6" title="Node colour black.">BLACK</a>;
<a name="l00508"></a>00508 ldns_rbtree_rotate_left(rbtree, child_parent);
<a name="l00509"></a>00509 }
<a name="l00510"></a>00510 }
<a name="l00511"></a>00511
<a name="l00512"></a>00512 <span class="keywordtype">int</span>
<a name="l00513"></a><a class="code" href="rbtree_8h.html#aaf5f35e7648861e0d1006f5de1199b14">00513</a> <a class="code" href="rbtree_8c.html#aaf5f35e7648861e0d1006f5de1199b14" title="Find, but match does not have to be exact.">ldns_rbtree_find_less_equal</a>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree, <span class="keyword">const</span> <span class="keywordtype">void</span> *key, <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> **result)
<a name="l00514"></a>00514 {
<a name="l00515"></a>00515 <span class="keywordtype">int</span> r;
<a name="l00516"></a>00516 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node;
<a name="l00517"></a>00517
<a name="l00518"></a>00518 <span class="comment">/* We start at root... */</span>
<a name="l00519"></a>00519 node = rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>;
<a name="l00520"></a>00520
<a name="l00521"></a>00521 *result = NULL;
<a name="l00522"></a>00522
<a name="l00523"></a>00523 <span class="comment">/* While there are children... */</span>
<a name="l00524"></a>00524 <span class="keywordflow">while</span> (node != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00525"></a>00525 r = rbtree-><a class="code" href="structldns__rbtree__t.html#ab8821c5723a7ac7304bc8f3d225395be" title="Key compare function.">cmp</a>(key, node-><a class="code" href="structldns__rbnode__t.html#ad6646f5af0664e6ddedbf78b9deed2dc" title="pointer to sorting key">key</a>);
<a name="l00526"></a>00526 <span class="keywordflow">if</span> (r == 0) {
<a name="l00527"></a>00527 <span class="comment">/* Exact match */</span>
<a name="l00528"></a>00528 *result = node;
<a name="l00529"></a>00529 <span class="keywordflow">return</span> 1;
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531 <span class="keywordflow">if</span> (r < 0) {
<a name="l00532"></a>00532 node = node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00533"></a>00533 } <span class="keywordflow">else</span> {
<a name="l00534"></a>00534 <span class="comment">/* Temporary match */</span>
<a name="l00535"></a>00535 *result = node;
<a name="l00536"></a>00536 node = node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00537"></a>00537 }
<a name="l00538"></a>00538 }
<a name="l00539"></a>00539 <span class="keywordflow">return</span> 0;
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541
<a name="l00542"></a>00542 <span class="comment">/*</span>
<a name="l00543"></a>00543 <span class="comment"> * Finds the first element in the red black tree</span>
<a name="l00544"></a>00544 <span class="comment"> *</span>
<a name="l00545"></a>00545 <span class="comment"> */</span>
<a name="l00546"></a>00546 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *
<a name="l00547"></a><a class="code" href="rbtree_8h.html#a76946c6350e5d16e645c5c0bbecfe017">00547</a> <a class="code" href="rbtree_8c.html#a76946c6350e5d16e645c5c0bbecfe017" title="Returns first (smallest) node in the tree.">ldns_rbtree_first</a> (<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree)
<a name="l00548"></a>00548 {
<a name="l00549"></a>00549 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node = rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>;
<a name="l00550"></a>00550
<a name="l00551"></a>00551 <span class="keywordflow">if</span> (rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00552"></a>00552 <span class="keywordflow">for</span> (node = rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>; node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>; node = node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>);
<a name="l00553"></a>00553 }
<a name="l00554"></a>00554 <span class="keywordflow">return</span> node;
<a name="l00555"></a>00555 }
<a name="l00556"></a>00556
<a name="l00557"></a>00557 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *
<a name="l00558"></a><a class="code" href="rbtree_8h.html#a627e270f8f549b2077c807ab2dd7b54a">00558</a> <a class="code" href="rbtree_8c.html#a627e270f8f549b2077c807ab2dd7b54a" title="Returns last (largest) node in the tree.">ldns_rbtree_last</a> (<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *rbtree)
<a name="l00559"></a>00559 {
<a name="l00560"></a>00560 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node = rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>;
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="keywordflow">if</span> (rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00563"></a>00563 <span class="keywordflow">for</span> (node = rbtree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>; node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>; node = node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>);
<a name="l00564"></a>00564 }
<a name="l00565"></a>00565 <span class="keywordflow">return</span> node;
<a name="l00566"></a>00566 }
<a name="l00567"></a>00567
<a name="l00568"></a>00568 <span class="comment">/*</span>
<a name="l00569"></a>00569 <span class="comment"> * Returns the next node...</span>
<a name="l00570"></a>00570 <span class="comment"> *</span>
<a name="l00571"></a>00571 <span class="comment"> */</span>
<a name="l00572"></a>00572 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *
<a name="l00573"></a><a class="code" href="rbtree_8h.html#a1700685fdaad3700634fa50a0a899a3e">00573</a> <a class="code" href="rbtree_8c.html#aabc52dfc43c1df5841be22543be1e5fe" title="Returns next larger node in the tree.">ldns_rbtree_next</a> (<a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node)
<a name="l00574"></a>00574 {
<a name="l00575"></a>00575 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *parent;
<a name="l00576"></a>00576
<a name="l00577"></a>00577 <span class="keywordflow">if</span> (node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00578"></a>00578 <span class="comment">/* One right, then keep on going left... */</span>
<a name="l00579"></a>00579 <span class="keywordflow">for</span> (node = node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>;
<a name="l00580"></a>00580 node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00581"></a>00581 node = node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>);
<a name="l00582"></a>00582 } <span class="keywordflow">else</span> {
<a name="l00583"></a>00583 parent = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00584"></a>00584 <span class="keywordflow">while</span> (parent != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a> && node == parent-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>) {
<a name="l00585"></a>00585 node = parent;
<a name="l00586"></a>00586 parent = parent-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00587"></a>00587 }
<a name="l00588"></a>00588 node = parent;
<a name="l00589"></a>00589 }
<a name="l00590"></a>00590 <span class="keywordflow">return</span> node;
<a name="l00591"></a>00591 }
<a name="l00592"></a>00592
<a name="l00593"></a>00593 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *
<a name="l00594"></a><a class="code" href="rbtree_8h.html#a50d8a3fcf5969a79866c887070f13f98">00594</a> <a class="code" href="rbtree_8c.html#a689087edc98b6726de13cc0d9c41a400" title="Returns previous smaller node in the tree.">ldns_rbtree_previous</a>(<a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *node)
<a name="l00595"></a>00595 {
<a name="l00596"></a>00596 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *parent;
<a name="l00597"></a>00597
<a name="l00598"></a>00598 <span class="keywordflow">if</span> (node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00599"></a>00599 <span class="comment">/* One left, then keep on going right... */</span>
<a name="l00600"></a>00600 <span class="keywordflow">for</span> (node = node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>;
<a name="l00601"></a>00601 node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a> != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>;
<a name="l00602"></a>00602 node = node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>);
<a name="l00603"></a>00603 } <span class="keywordflow">else</span> {
<a name="l00604"></a>00604 parent = node-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00605"></a>00605 <span class="keywordflow">while</span> (parent != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a> && node == parent-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>) {
<a name="l00606"></a>00606 node = parent;
<a name="l00607"></a>00607 parent = parent-><a class="code" href="structldns__rbnode__t.html#ad336f8689a228766cff8fadd306eff7b" title="parent in rbtree, RBTREE_NULL for root">parent</a>;
<a name="l00608"></a>00608 }
<a name="l00609"></a>00609 node = parent;
<a name="l00610"></a>00610 }
<a name="l00611"></a>00611 <span class="keywordflow">return</span> node;
<a name="l00612"></a>00612 }
<a name="l00613"></a>00613
<a name="l00618"></a>00618 <a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *
<a name="l00619"></a><a class="code" href="rbtree_8h.html#a211164b6238ae3aa0c6ad567e8c78944">00619</a> <a class="code" href="rbtree_8c.html#a211164b6238ae3aa0c6ad567e8c78944" title="split off elements number of elements from the start of the name tree and return a new tree...">ldns_rbtree_split</a>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *tree,
<a name="l00620"></a>00620 <span class="keywordtype">size_t</span> elements)
<a name="l00621"></a>00621 {
<a name="l00622"></a>00622 <a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *new_tree;
<a name="l00623"></a>00623 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *cur_node;
<a name="l00624"></a>00624 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a> *move_node;
<a name="l00625"></a>00625 <span class="keywordtype">size_t</span> count = 0;
<a name="l00626"></a>00626
<a name="l00627"></a>00627 new_tree = <a class="code" href="rbtree_8c.html#a1319e3ff5b8355d6e1e7b65554bc854d" title="Create new tree (malloced) with given key compare function.">ldns_rbtree_create</a>(tree-><a class="code" href="structldns__rbtree__t.html#ab8821c5723a7ac7304bc8f3d225395be" title="Key compare function.">cmp</a>);
<a name="l00628"></a>00628
<a name="l00629"></a>00629 cur_node = <a class="code" href="rbtree_8c.html#a76946c6350e5d16e645c5c0bbecfe017" title="Returns first (smallest) node in the tree.">ldns_rbtree_first</a>(tree);
<a name="l00630"></a>00630 <span class="keywordflow">while</span> (count < elements && cur_node != <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>) {
<a name="l00631"></a>00631 move_node = <a class="code" href="rbtree_8c.html#ab6d2736cd058aaee5af1bf4d59265764" title="Delete element from tree.">ldns_rbtree_delete</a>(tree, cur_node-><a class="code" href="structldns__rbnode__t.html#ad6646f5af0664e6ddedbf78b9deed2dc" title="pointer to sorting key">key</a>);
<a name="l00632"></a>00632 (void)<a class="code" href="rbtree_8c.html#af7453903aed843b18ec24de879faf98f" title="Insert data into the tree.">ldns_rbtree_insert</a>(new_tree, move_node);
<a name="l00633"></a>00633 cur_node = <a class="code" href="rbtree_8c.html#a76946c6350e5d16e645c5c0bbecfe017" title="Returns first (smallest) node in the tree.">ldns_rbtree_first</a>(tree);
<a name="l00634"></a>00634 count++;
<a name="l00635"></a>00635 }
<a name="l00636"></a>00636
<a name="l00637"></a>00637 <span class="keywordflow">return</span> new_tree;
<a name="l00638"></a>00638 }
<a name="l00639"></a>00639
<a name="l00640"></a>00640 <span class="comment">/*</span>
<a name="l00641"></a>00641 <span class="comment"> * add all node from the second tree to the first (removing them from the</span>
<a name="l00642"></a>00642 <span class="comment"> * second), and fix up nsec(3)s if present</span>
<a name="l00643"></a>00643 <span class="comment"> */</span>
<a name="l00644"></a>00644 <span class="keywordtype">void</span>
<a name="l00645"></a><a class="code" href="rbtree_8h.html#abf2881787d48cdf3052dd1aee89520c0">00645</a> <a class="code" href="rbtree_8c.html#abf2881787d48cdf3052dd1aee89520c0" title="add all node from the second tree to the first (removing them from the second), and fix up nsec(3)s i...">ldns_rbtree_join</a>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *tree1, <a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a> *tree2)
<a name="l00646"></a>00646 {
<a name="l00647"></a>00647 <a class="code" href="rbtree_8c.html#a1f41891c270cf01b4c73b706eb8f6d67" title="Call function for all elements in the redblack tree, such that leaf elements are called before parent...">ldns_traverse_postorder</a>(tree2, <a class="code" href="rbtree_8c.html#a7cfa1759127e6133df02b04731b05dc9" title="Insert data into the tree (reversed arguments, for use as callback)">ldns_rbtree_insert_vref</a>, tree1);
<a name="l00648"></a>00648 }
<a name="l00649"></a>00649
<a name="l00651"></a>00651 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00652"></a>00652 traverse_post(<span class="keywordtype">void</span> (*func)(<a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>*, <span class="keywordtype">void</span>*), <span class="keywordtype">void</span>* arg,
<a name="l00653"></a>00653 <a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>* node)
<a name="l00654"></a>00654 {
<a name="l00655"></a>00655 <span class="keywordflow">if</span>(!node || node == <a class="code" href="rbtree_8h.html#ab30c305b53af0832956712d035d96631" title="The nullpointer, points to empty node.">LDNS_RBTREE_NULL</a>)
<a name="l00656"></a>00656 <span class="keywordflow">return</span>;
<a name="l00657"></a>00657 <span class="comment">/* recurse */</span>
<a name="l00658"></a>00658 traverse_post(func, arg, node-><a class="code" href="structldns__rbnode__t.html#af31105c7c53f42b9af14c8bcdadf9a5f" title="left node (smaller items)">left</a>);
<a name="l00659"></a>00659 traverse_post(func, arg, node-><a class="code" href="structldns__rbnode__t.html#ac9f7ea4d4c64cb094b56f1c48fb16ba2" title="right node (larger items)">right</a>);
<a name="l00660"></a>00660 <span class="comment">/* call user func */</span>
<a name="l00661"></a>00661 (*func)(node, arg);
<a name="l00662"></a>00662 }
<a name="l00663"></a>00663
<a name="l00664"></a>00664 <span class="keywordtype">void</span>
<a name="l00665"></a><a class="code" href="rbtree_8h.html#a1f41891c270cf01b4c73b706eb8f6d67">00665</a> <a class="code" href="rbtree_8c.html#a1f41891c270cf01b4c73b706eb8f6d67" title="Call function for all elements in the redblack tree, such that leaf elements are called before parent...">ldns_traverse_postorder</a>(<a class="code" href="structldns__rbtree__t.html" title="definition for tree struct">ldns_rbtree_t</a>* tree,
<a name="l00666"></a>00666 <span class="keywordtype">void</span> (*func)(<a class="code" href="structldns__rbnode__t.html" title="The rbnode_t struct definition.">ldns_rbnode_t</a>*, <span class="keywordtype">void</span>*), <span class="keywordtype">void</span>* arg)
<a name="l00667"></a>00667 {
<a name="l00668"></a>00668 traverse_post(func, arg, tree-><a class="code" href="structldns__rbtree__t.html#abfa0bbc0290bf80cfcb4b239a3e84046" title="The root of the red-black tree.">root</a>);
<a name="l00669"></a>00669 }
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Wed Jan 11 2012 for ldns by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>
