| Current File : //usr/share/doc/dbus/api/dbus-hash_8c_source.html |
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>D-Bus: dbus-hash.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">D-Bus
 <span id="projectnumber">1.8.20</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- Generated by Doxygen 1.7.6.1 -->
<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="modules.html"><span>Modules</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>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">dbus-hash.c</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- mode: C; c-file-style: "gnu"; indent-tabs-mode: nil; -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* dbus-hash.c Generic hash table utility (internal to D-Bus implementation)</span>
<a name="l00003"></a>00003 <span class="comment"> * </span>
<a name="l00004"></a>00004 <span class="comment"> * Copyright (C) 2002 Red Hat, Inc.</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (c) 1991-1993 The Regents of the University of California.</span>
<a name="l00006"></a>00006 <span class="comment"> * Copyright (c) 1994 Sun Microsystems, Inc.</span>
<a name="l00007"></a>00007 <span class="comment"> * </span>
<a name="l00008"></a>00008 <span class="comment"> * Hash table implementation based on generic/tclHash.c from the Tcl</span>
<a name="l00009"></a>00009 <span class="comment"> * source code. The original Tcl license applies to portions of the</span>
<a name="l00010"></a>00010 <span class="comment"> * code from tclHash.c; the Tcl license follows this standad D-Bus </span>
<a name="l00011"></a>00011 <span class="comment"> * license information.</span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * Licensed under the Academic Free License version 2.1</span>
<a name="l00014"></a>00014 <span class="comment"> * </span>
<a name="l00015"></a>00015 <span class="comment"> * This program is free software; you can redistribute it and/or modify</span>
<a name="l00016"></a>00016 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00017"></a>00017 <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00018"></a>00018 <span class="comment"> * (at your option) any later version.</span>
<a name="l00019"></a>00019 <span class="comment"> *</span>
<a name="l00020"></a>00020 <span class="comment"> * This program is distributed in the hope that it will be useful,</span>
<a name="l00021"></a>00021 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00022"></a>00022 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00023"></a>00023 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00024"></a>00024 <span class="comment"> * </span>
<a name="l00025"></a>00025 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00026"></a>00026 <span class="comment"> * along with this program; if not, write to the Free Software</span>
<a name="l00027"></a>00027 <span class="comment"> * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA</span>
<a name="l00028"></a>00028 <span class="comment"> *</span>
<a name="l00029"></a>00029 <span class="comment"> */</span>
<a name="l00030"></a>00030 <span class="comment">/* </span>
<a name="l00031"></a>00031 <span class="comment"> * The following copyright applies to code from the Tcl distribution.</span>
<a name="l00032"></a>00032 <span class="comment"> *</span>
<a name="l00033"></a>00033 <span class="comment"> * Copyright (c) 1991-1993 The Regents of the University of California.</span>
<a name="l00034"></a>00034 <span class="comment"> * Copyright (c) 1994 Sun Microsystems, Inc.</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> * This software is copyrighted by the Regents of the University of</span>
<a name="l00037"></a>00037 <span class="comment"> * California, Sun Microsystems, Inc., Scriptics Corporation, and</span>
<a name="l00038"></a>00038 <span class="comment"> * other parties. The following terms apply to all files associated</span>
<a name="l00039"></a>00039 <span class="comment"> * with the software unless explicitly disclaimed in individual files.</span>
<a name="l00040"></a>00040 <span class="comment"> * </span>
<a name="l00041"></a>00041 <span class="comment"> * The authors hereby grant permission to use, copy, modify,</span>
<a name="l00042"></a>00042 <span class="comment"> * distribute, and license this software and its documentation for any</span>
<a name="l00043"></a>00043 <span class="comment"> * purpose, provided that existing copyright notices are retained in</span>
<a name="l00044"></a>00044 <span class="comment"> * all copies and that this notice is included verbatim in any</span>
<a name="l00045"></a>00045 <span class="comment"> * distributions. No written agreement, license, or royalty fee is</span>
<a name="l00046"></a>00046 <span class="comment"> * required for any of the authorized uses. Modifications to this</span>
<a name="l00047"></a>00047 <span class="comment"> * software may be copyrighted by their authors and need not follow</span>
<a name="l00048"></a>00048 <span class="comment"> * the licensing terms described here, provided that the new terms are</span>
<a name="l00049"></a>00049 <span class="comment"> * clearly indicated on the first page of each file where they apply.</span>
<a name="l00050"></a>00050 <span class="comment"> * </span>
<a name="l00051"></a>00051 <span class="comment"> * IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY</span>
<a name="l00052"></a>00052 <span class="comment"> * PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL</span>
<a name="l00053"></a>00053 <span class="comment"> * DAMAGES ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION,</span>
<a name="l00054"></a>00054 <span class="comment"> * OR ANY DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED</span>
<a name="l00055"></a>00055 <span class="comment"> * OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00056"></a>00056 <span class="comment"> * </span>
<a name="l00057"></a>00057 <span class="comment"> * THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,</span>
<a name="l00058"></a>00058 <span class="comment"> * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF</span>
<a name="l00059"></a>00059 <span class="comment"> * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND</span>
<a name="l00060"></a>00060 <span class="comment"> * NON-INFRINGEMENT. THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS,</span>
<a name="l00061"></a>00061 <span class="comment"> * AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE</span>
<a name="l00062"></a>00062 <span class="comment"> * MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.</span>
<a name="l00063"></a>00063 <span class="comment"> * </span>
<a name="l00064"></a>00064 <span class="comment"> * GOVERNMENT USE: If you are acquiring this software on behalf of the</span>
<a name="l00065"></a>00065 <span class="comment"> * U.S. government, the Government shall have only "Restricted Rights"</span>
<a name="l00066"></a>00066 <span class="comment"> * in the software and related documentation as defined in the Federal</span>
<a name="l00067"></a>00067 <span class="comment"> * Acquisition Regulations (FARs) in Clause 52.227.19 (c) (2). If you</span>
<a name="l00068"></a>00068 <span class="comment"> * are acquiring the software on behalf of the Department of Defense,</span>
<a name="l00069"></a>00069 <span class="comment"> * the software shall be classified as "Commercial Computer Software"</span>
<a name="l00070"></a>00070 <span class="comment"> * and the Government shall have only "Restricted Rights" as defined</span>
<a name="l00071"></a>00071 <span class="comment"> * in Clause 252.227-7013 (c) (1) of DFARs. Notwithstanding the</span>
<a name="l00072"></a>00072 <span class="comment"> * foregoing, the authors grant the U.S. Government and others acting</span>
<a name="l00073"></a>00073 <span class="comment"> * in its behalf permission to use and distribute the software in</span>
<a name="l00074"></a>00074 <span class="comment"> * accordance with the terms specified in this license.</span>
<a name="l00075"></a>00075 <span class="comment"> */</span>
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="preprocessor">#include <config.h></span>
<a name="l00078"></a>00078 <span class="preprocessor">#include "dbus-hash.h"</span>
<a name="l00079"></a>00079 <span class="preprocessor">#include "dbus-internals.h"</span>
<a name="l00080"></a>00080 <span class="preprocessor">#include "dbus-mempool.h"</span>
<a name="l00081"></a>00081
<a name="l00104"></a><a class="code" href="group__DBusHashTableInternals.html#ga8c6d6296d450e37074dbd8c15638b499">00104</a> <span class="preprocessor">#define REBUILD_MULTIPLIER 3</span>
<a name="l00105"></a>00105 <span class="preprocessor"></span>
<a name="l00122"></a><a class="code" href="group__DBusHashTableInternals.html#ga9dc8fd5a9e25bd2b229366a683ff78f9">00122</a> <span class="preprocessor">#define RANDOM_INDEX(table, i) \</span>
<a name="l00123"></a>00123 <span class="preprocessor"> (((((intptr_t) (i))*1103515245) >> (table)->down_shift) & (table)->mask)</span>
<a name="l00124"></a>00124 <span class="preprocessor"></span>
<a name="l00130"></a><a class="code" href="group__DBusHashTableInternals.html#ga4518324f3c3caacf5694065f4f6071d8">00130</a> <span class="preprocessor">#define DBUS_SMALL_HASH_TABLE 4</span>
<a name="l00131"></a>00131 <span class="preprocessor"></span>
<a name="l00135"></a><a class="code" href="group__DBusHashTableInternals.html#gad7d2d7c568541eeeb86104138d64a9f3">00135</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>;
<a name="l00136"></a>00136
<a name="l00143"></a><a class="code" href="structDBusHashEntry.html">00143</a> <span class="keyword">struct </span><a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>
<a name="l00144"></a>00144 {
<a name="l00145"></a><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501">00145</a> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *<a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00149"></a><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894">00149</a> <span class="keywordtype">void</span> *<a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>;
<a name="l00150"></a><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e">00150</a> <span class="keywordtype">void</span> *<a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>;
<a name="l00151"></a>00151 };
<a name="l00152"></a>00152
<a name="l00156"></a><a class="code" href="group__DBusHashTableInternals.html#ga20a95a9ff37ad777575336e9e4fd8a10">00156</a> <span class="keyword">typedef</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>* (* DBusFindEntryFunction) (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00157"></a>00157 <span class="keywordtype">void</span> *key,
<a name="l00158"></a>00158 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> create_if_not_found,
<a name="l00159"></a>00159 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket,
<a name="l00160"></a>00160 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated);
<a name="l00161"></a>00161
<a name="l00168"></a><a class="code" href="structDBusHashTable.html">00168</a> <span class="keyword">struct </span><a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> {
<a name="l00169"></a><a class="code" href="structDBusHashTable.html#acb2b7bcba65da77f7ecf67da355ff770">00169</a> <span class="keywordtype">int</span> <a class="code" href="structDBusHashTable.html#acb2b7bcba65da77f7ecf67da355ff770" title="Reference count.">refcount</a>;
<a name="l00171"></a><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d">00171</a> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **<a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>;
<a name="l00175"></a>00175 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *<a class="code" href="structDBusHashTable.html#af71877d64657c34a783caf6b82b016e9" title="Bucket array used for small tables (to avoid mallocs and frees).">static_buckets</a>[<a class="code" href="group__DBusHashTableInternals.html#ga4518324f3c3caacf5694065f4f6071d8" title="Initial number of buckets in hash table (hash table statically allocates its buckets for this size an...">DBUS_SMALL_HASH_TABLE</a>];
<a name="l00179"></a><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7">00179</a> <span class="keywordtype">int</span> <a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a>;
<a name="l00182"></a><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650">00182</a> <span class="keywordtype">int</span> <a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a>;
<a name="l00185"></a><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf">00185</a> <span class="keywordtype">int</span> <a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a>;
<a name="l00188"></a><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419">00188</a> <span class="keywordtype">int</span> <a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a>;
<a name="l00191"></a><a class="code" href="structDBusHashTable.html#a2e7e7b92bb9633ab95cfaa592b89025c">00191</a> <span class="keywordtype">int</span> <a class="code" href="structDBusHashTable.html#a2e7e7b92bb9633ab95cfaa592b89025c" title="Shift count used in hashing function.">down_shift</a>;
<a name="l00195"></a><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9">00195</a> <span class="keywordtype">int</span> <a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a>;
<a name="l00198"></a><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092">00198</a> <a class="code" href="group__DBusHashTable.html#gab0ab9767ffa5b6720a13b3d741630852" title="Indicates the type of a key in the hash table.">DBusHashType</a> <a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a>;
<a name="l00201"></a><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35">00201</a> <a class="code" href="group__DBusHashTableInternals.html#ga20a95a9ff37ad777575336e9e4fd8a10" title="Function used to find and optionally create a hash entry.">DBusFindEntryFunction</a> <a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>;
<a name="l00203"></a><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6">00203</a> <a class="code" href="group__DBusMemory.html#ga061bcded226d76c7d7de35beaa165cb5" title="The type of a function which frees a block of memory.">DBusFreeFunction</a> <a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a>;
<a name="l00204"></a><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca">00204</a> <a class="code" href="group__DBusMemory.html#ga061bcded226d76c7d7de35beaa165cb5" title="The type of a function which frees a block of memory.">DBusFreeFunction</a> <a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a>;
<a name="l00206"></a><a class="code" href="structDBusHashTable.html#ad1224e6c3c632afb265b78f8f6e30f97">00206</a> <a class="code" href="structDBusMemPool.html" title="Internals fields of DBusMemPool.">DBusMemPool</a> *<a class="code" href="structDBusHashTable.html#ad1224e6c3c632afb265b78f8f6e30f97" title="Memory pool for hash entries.">entry_pool</a>;
<a name="l00207"></a>00207 };
<a name="l00208"></a>00208
<a name="l00212"></a><a class="code" href="structDBusRealHashIter.html">00212</a> <span class="keyword">typedef</span> <span class="keyword">struct</span>
<a name="l00213"></a>00213 {
<a name="l00214"></a><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633">00214</a> <a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *<a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a>;
<a name="l00215"></a><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa">00215</a> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket;
<a name="l00219"></a><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7">00219</a> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *<a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>;
<a name="l00220"></a><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0">00220</a> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *<a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a>;
<a name="l00221"></a><a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824">00221</a> <span class="keywordtype">int</span> <a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824" title="index of next bucket">next_bucket</a>;
<a name="l00222"></a><a class="code" href="structDBusRealHashIter.html#a84f2a189ee1eb3e51a8089b798a7797a">00222</a> <span class="keywordtype">int</span> <a class="code" href="structDBusRealHashIter.html#a84f2a189ee1eb3e51a8089b798a7797a" title="used to detect table resize since initialization">n_entries_on_init</a>;
<a name="l00223"></a>00223 } <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>;
<a name="l00224"></a>00224
<a name="l00225"></a>00225 _DBUS_STATIC_ASSERT (<span class="keyword">sizeof</span> (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>) == <span class="keyword">sizeof</span> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a>));
<a name="l00226"></a>00226
<a name="l00227"></a>00227 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>* find_direct_function (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00228"></a>00228 <span class="keywordtype">void</span> *key,
<a name="l00229"></a>00229 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> create_if_not_found,
<a name="l00230"></a>00230 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket,
<a name="l00231"></a>00231 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated);
<a name="l00232"></a>00232 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>* find_string_function (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00233"></a>00233 <span class="keywordtype">void</span> *key,
<a name="l00234"></a>00234 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> create_if_not_found,
<a name="l00235"></a>00235 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket,
<a name="l00236"></a>00236 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated);
<a name="l00237"></a>00237 <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> string_hash (<span class="keyword">const</span> <span class="keywordtype">char</span> *str);
<a name="l00238"></a>00238 <span class="keyword">static</span> <span class="keywordtype">void</span> rebuild_table (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table);
<a name="l00239"></a>00239 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>* alloc_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table);
<a name="l00240"></a>00240 <span class="keyword">static</span> <span class="keywordtype">void</span> remove_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00241"></a>00241 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket,
<a name="l00242"></a>00242 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry);
<a name="l00243"></a>00243 <span class="keyword">static</span> <span class="keywordtype">void</span> free_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00244"></a>00244 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry);
<a name="l00245"></a>00245 <span class="keyword">static</span> <span class="keywordtype">void</span> free_entry_data (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00246"></a>00246 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry);
<a name="l00247"></a>00247
<a name="l00248"></a>00248
<a name="l00284"></a>00284 <a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a>*
<a name="l00285"></a><a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4">00285</a> <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#gab0ab9767ffa5b6720a13b3d741630852" title="Indicates the type of a key in the hash table.">DBusHashType</a> type,
<a name="l00286"></a>00286 <a class="code" href="group__DBusMemory.html#ga061bcded226d76c7d7de35beaa165cb5" title="The type of a function which frees a block of memory.">DBusFreeFunction</a> key_free_function,
<a name="l00287"></a>00287 <a class="code" href="group__DBusMemory.html#ga061bcded226d76c7d7de35beaa165cb5" title="The type of a function which frees a block of memory.">DBusFreeFunction</a> value_free_function)
<a name="l00288"></a>00288 {
<a name="l00289"></a>00289 <a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table;
<a name="l00290"></a>00290 <a class="code" href="structDBusMemPool.html" title="Internals fields of DBusMemPool.">DBusMemPool</a> *entry_pool;
<a name="l00291"></a>00291
<a name="l00292"></a>00292 table = <a class="code" href="group__DBusMemory.html#gaba9d823abda7f4cadbaf5177d3b8b793" title="Safe macro for using dbus_malloc0().">dbus_new0</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a>, 1);
<a name="l00293"></a>00293 <span class="keywordflow">if</span> (table == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00294"></a>00294 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00295"></a>00295
<a name="l00296"></a>00296 entry_pool = <a class="code" href="group__DBusMemPool.html#gaf1bae02bc5fcb879f77ff2c13ca03ac8" title="Creates a new memory pool, or returns NULL on failure.">_dbus_mem_pool_new</a> (<span class="keyword">sizeof</span> (<a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>), <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>);
<a name="l00297"></a>00297 <span class="keywordflow">if</span> (entry_pool == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00298"></a>00298 {
<a name="l00299"></a>00299 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a> (table);
<a name="l00300"></a>00300 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302
<a name="l00303"></a>00303 table-><a class="code" href="structDBusHashTable.html#acb2b7bcba65da77f7ecf67da355ff770" title="Reference count.">refcount</a> = 1;
<a name="l00304"></a>00304 table-><a class="code" href="structDBusHashTable.html#ad1224e6c3c632afb265b78f8f6e30f97" title="Memory pool for hash entries.">entry_pool</a> = entry_pool;
<a name="l00305"></a>00305
<a name="l00306"></a>00306 _dbus_assert (<a class="code" href="group__DBusHashTableInternals.html#ga4518324f3c3caacf5694065f4f6071d8" title="Initial number of buckets in hash table (hash table statically allocates its buckets for this size an...">DBUS_SMALL_HASH_TABLE</a> == _DBUS_N_ELEMENTS (table-><a class="code" href="structDBusHashTable.html#af71877d64657c34a783caf6b82b016e9" title="Bucket array used for small tables (to avoid mallocs and frees).">static_buckets</a>));
<a name="l00307"></a>00307
<a name="l00308"></a>00308 table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a> = table-><a class="code" href="structDBusHashTable.html#af71877d64657c34a783caf6b82b016e9" title="Bucket array used for small tables (to avoid mallocs and frees).">static_buckets</a>;
<a name="l00309"></a>00309 table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a> = <a class="code" href="group__DBusHashTableInternals.html#ga4518324f3c3caacf5694065f4f6071d8" title="Initial number of buckets in hash table (hash table statically allocates its buckets for this size an...">DBUS_SMALL_HASH_TABLE</a>;
<a name="l00310"></a>00310 table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a> = 0;
<a name="l00311"></a>00311 table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a> = <a class="code" href="group__DBusHashTableInternals.html#ga4518324f3c3caacf5694065f4f6071d8" title="Initial number of buckets in hash table (hash table statically allocates its buckets for this size an...">DBUS_SMALL_HASH_TABLE</a> * <a class="code" href="group__DBusHashTableInternals.html#ga8c6d6296d450e37074dbd8c15638b499" title="When there are this many entries per bucket, on average, rebuild the hash table to make it larger...">REBUILD_MULTIPLIER</a>;
<a name="l00312"></a>00312 table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a> = 0;
<a name="l00313"></a>00313 table-><a class="code" href="structDBusHashTable.html#a2e7e7b92bb9633ab95cfaa592b89025c" title="Shift count used in hashing function.">down_shift</a> = 28;
<a name="l00314"></a>00314 table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> = 3;
<a name="l00315"></a>00315 table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> = type;
<a name="l00316"></a>00316
<a name="l00317"></a>00317 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> < table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a>);
<a name="l00318"></a>00318
<a name="l00319"></a>00319 <span class="keywordflow">switch</span> (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a>)
<a name="l00320"></a>00320 {
<a name="l00321"></a>00321 <span class="keywordflow">case</span> <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>:
<a name="l00322"></a>00322 <span class="keywordflow">case</span> <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a477caf35cc3676d6412c9b57f1d0f6c7" title="Hash keys are integer capable to hold a pointer.">DBUS_HASH_UINTPTR</a>:
<a name="l00323"></a>00323 table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a> = find_direct_function;
<a name="l00324"></a>00324 <span class="keywordflow">break</span>;
<a name="l00325"></a>00325 <span class="keywordflow">case</span> <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>:
<a name="l00326"></a>00326 table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a> = find_string_function;
<a name="l00327"></a>00327 <span class="keywordflow">break</span>;
<a name="l00328"></a>00328 <span class="keywordflow">default</span>:
<a name="l00329"></a>00329 _dbus_assert_not_reached (<span class="stringliteral">"Unknown hash table type"</span>);
<a name="l00330"></a>00330 <span class="keywordflow">break</span>;
<a name="l00331"></a>00331 }
<a name="l00332"></a>00332
<a name="l00333"></a>00333 table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a> = key_free_function;
<a name="l00334"></a>00334 table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a> = value_free_function;
<a name="l00335"></a>00335
<a name="l00336"></a>00336 <span class="keywordflow">return</span> table;
<a name="l00337"></a>00337 }
<a name="l00338"></a>00338
<a name="l00339"></a>00339
<a name="l00346"></a>00346 <a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *
<a name="l00347"></a><a class="code" href="group__DBusHashTable.html#ga4ad4622378885e5d911c26956e174a45">00347</a> <a class="code" href="group__DBusHashTable.html#ga4ad4622378885e5d911c26956e174a45" title="Increments the reference count for a hash table.">_dbus_hash_table_ref</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l00348"></a>00348 {
<a name="l00349"></a>00349 table-><a class="code" href="structDBusHashTable.html#acb2b7bcba65da77f7ecf67da355ff770" title="Reference count.">refcount</a> += 1;
<a name="l00350"></a>00350
<a name="l00351"></a>00351 <span class="keywordflow">return</span> table;
<a name="l00352"></a>00352 }
<a name="l00353"></a>00353
<a name="l00360"></a>00360 <span class="keywordtype">void</span>
<a name="l00361"></a><a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9">00361</a> <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l00362"></a>00362 {
<a name="l00363"></a>00363 table-><a class="code" href="structDBusHashTable.html#acb2b7bcba65da77f7ecf67da355ff770" title="Reference count.">refcount</a> -= 1;
<a name="l00364"></a>00364
<a name="l00365"></a>00365 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#acb2b7bcba65da77f7ecf67da355ff770" title="Reference count.">refcount</a> == 0)
<a name="l00366"></a>00366 {
<a name="l00367"></a>00367 <span class="preprocessor">#if 0</span>
<a name="l00368"></a>00368 <span class="preprocessor"></span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l00369"></a>00369 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *next;
<a name="l00370"></a>00370 <span class="keywordtype">int</span> i;
<a name="l00371"></a>00371
<a name="l00372"></a>00372 <span class="comment">/* Free the entries in the table. */</span>
<a name="l00373"></a>00373 <span class="keywordflow">for</span> (i = 0; i < table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a>; i++)
<a name="l00374"></a>00374 {
<a name="l00375"></a>00375 entry = table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[i];
<a name="l00376"></a>00376 <span class="keywordflow">while</span> (entry != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00377"></a>00377 {
<a name="l00378"></a>00378 next = entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00379"></a>00379
<a name="l00380"></a>00380 free_entry (table, entry);
<a name="l00381"></a>00381
<a name="l00382"></a>00382 entry = next;
<a name="l00383"></a>00383 }
<a name="l00384"></a>00384 }
<a name="l00385"></a>00385 <span class="preprocessor">#else</span>
<a name="l00386"></a>00386 <span class="preprocessor"></span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l00387"></a>00387 <span class="keywordtype">int</span> i;
<a name="l00388"></a>00388
<a name="l00389"></a>00389 <span class="comment">/* Free the entries in the table. */</span>
<a name="l00390"></a>00390 <span class="keywordflow">for</span> (i = 0; i < table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a>; i++)
<a name="l00391"></a>00391 {
<a name="l00392"></a>00392 entry = table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[i];
<a name="l00393"></a>00393 <span class="keywordflow">while</span> (entry != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00394"></a>00394 {
<a name="l00395"></a>00395 free_entry_data (table, entry);
<a name="l00396"></a>00396
<a name="l00397"></a>00397 entry = entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00398"></a>00398 }
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400 <span class="comment">/* We can do this very quickly with memory pools ;-) */</span>
<a name="l00401"></a>00401 <a class="code" href="group__DBusMemPool.html#ga58e4f3def46410d5bb138a2b8f366b1a" title="Frees a memory pool (and all elements allocated from it).">_dbus_mem_pool_free</a> (table-><a class="code" href="structDBusHashTable.html#ad1224e6c3c632afb265b78f8f6e30f97" title="Memory pool for hash entries.">entry_pool</a>);
<a name="l00402"></a>00402 <span class="preprocessor">#endif</span>
<a name="l00403"></a>00403 <span class="preprocessor"></span>
<a name="l00404"></a>00404 <span class="comment">/* Free the bucket array, if it was dynamically allocated. */</span>
<a name="l00405"></a>00405 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a> != table-><a class="code" href="structDBusHashTable.html#af71877d64657c34a783caf6b82b016e9" title="Bucket array used for small tables (to avoid mallocs and frees).">static_buckets</a>)
<a name="l00406"></a>00406 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a> (table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>);
<a name="l00407"></a>00407
<a name="l00408"></a>00408 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a> (table);
<a name="l00409"></a>00409 }
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411
<a name="l00417"></a>00417 <span class="keywordtype">void</span>
<a name="l00418"></a><a class="code" href="group__DBusHashTable.html#gad169f3790ca67f8a0adafcdc88ef7188">00418</a> <a class="code" href="group__DBusHashTable.html#gad169f3790ca67f8a0adafcdc88ef7188" title="Removed all entries from a hash table.">_dbus_hash_table_remove_all</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l00419"></a>00419 {
<a name="l00420"></a>00420 <a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> iter;
<a name="l00421"></a>00421 <a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c" title="Initializes a hash table iterator.">_dbus_hash_iter_init</a> (table, &iter);
<a name="l00422"></a>00422 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l00423"></a>00423 {
<a name="l00424"></a>00424 <a class="code" href="group__DBusHashTable.html#ga0ef12d773a546f070cff91cbf1e8d16e" title="Removes the current entry from the hash table.">_dbus_hash_iter_remove_entry</a>(&iter);
<a name="l00425"></a>00425 }
<a name="l00426"></a>00426 }
<a name="l00427"></a>00427
<a name="l00428"></a>00428 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*
<a name="l00429"></a>00429 alloc_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l00430"></a>00430 {
<a name="l00431"></a>00431 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l00432"></a>00432
<a name="l00433"></a>00433 entry = <a class="code" href="group__DBusMemPool.html#ga0946d54f767b4f55238f5a39c8543df1" title="Allocates an object from the memory pool.">_dbus_mem_pool_alloc</a> (table-><a class="code" href="structDBusHashTable.html#ad1224e6c3c632afb265b78f8f6e30f97" title="Memory pool for hash entries.">entry_pool</a>);
<a name="l00434"></a>00434
<a name="l00435"></a>00435 <span class="keywordflow">return</span> entry;
<a name="l00436"></a>00436 }
<a name="l00437"></a>00437
<a name="l00438"></a>00438 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00439"></a>00439 free_entry_data (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00440"></a>00440 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry)
<a name="l00441"></a>00441 {
<a name="l00442"></a>00442 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a>)
<a name="l00443"></a>00443 (* table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>);
<a name="l00444"></a>00444 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a>)
<a name="l00445"></a>00445 (* table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>);
<a name="l00446"></a>00446 }
<a name="l00447"></a>00447
<a name="l00448"></a>00448 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00449"></a>00449 free_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00450"></a>00450 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry)
<a name="l00451"></a>00451 {
<a name="l00452"></a>00452 free_entry_data (table, entry);
<a name="l00453"></a>00453 <a class="code" href="group__DBusMemPool.html#ga4e2feaefee7384ed940059e6c7b0a9d5" title="Deallocates an object previously created with _dbus_mem_pool_alloc().">_dbus_mem_pool_dealloc</a> (table-><a class="code" href="structDBusHashTable.html#ad1224e6c3c632afb265b78f8f6e30f97" title="Memory pool for hash entries.">entry_pool</a>, entry);
<a name="l00454"></a>00454 }
<a name="l00455"></a>00455
<a name="l00456"></a>00456 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00457"></a>00457 remove_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00458"></a>00458 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket,
<a name="l00459"></a>00459 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry)
<a name="l00460"></a>00460 {
<a name="l00461"></a>00461 _dbus_assert (table != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00462"></a>00462 _dbus_assert (bucket != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00463"></a>00463 _dbus_assert (*bucket != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00464"></a>00464 _dbus_assert (entry != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00465"></a>00465
<a name="l00466"></a>00466 <span class="keywordflow">if</span> (*bucket == entry)
<a name="l00467"></a>00467 *bucket = entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00468"></a>00468 <span class="keywordflow">else</span>
<a name="l00469"></a>00469 {
<a name="l00470"></a>00470 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *prev;
<a name="l00471"></a>00471 prev = *bucket;
<a name="l00472"></a>00472
<a name="l00473"></a>00473 <span class="keywordflow">while</span> (prev-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a> != entry)
<a name="l00474"></a>00474 prev = prev-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00475"></a>00475
<a name="l00476"></a>00476 _dbus_assert (prev != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00477"></a>00477
<a name="l00478"></a>00478 prev-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a> = entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480
<a name="l00481"></a>00481 table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a> -= 1;
<a name="l00482"></a>00482 free_entry (table, entry);
<a name="l00483"></a>00483 }
<a name="l00484"></a>00484
<a name="l00516"></a>00516 <span class="keywordtype">void</span>
<a name="l00517"></a><a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c">00517</a> <a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c" title="Initializes a hash table iterator.">_dbus_hash_iter_init</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00518"></a>00518 <a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00519"></a>00519 {
<a name="l00520"></a>00520 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00521"></a>00521
<a name="l00522"></a>00522 _dbus_assert (<span class="keyword">sizeof</span> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a>) == <span class="keyword">sizeof</span> (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>));
<a name="l00523"></a>00523
<a name="l00524"></a>00524 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00525"></a>00525
<a name="l00526"></a>00526 real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> = table;
<a name="l00527"></a>00527 real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a> = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00528"></a>00528 real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00529"></a>00529 real-><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a> = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00530"></a>00530 real-><a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824" title="index of next bucket">next_bucket</a> = 0;
<a name="l00531"></a>00531 real-><a class="code" href="structDBusRealHashIter.html#a84f2a189ee1eb3e51a8089b798a7797a" title="used to detect table resize since initialization">n_entries_on_init</a> = table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a>;
<a name="l00532"></a>00532 }
<a name="l00533"></a>00533
<a name="l00542"></a>00542 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l00543"></a><a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c">00543</a> <a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00544"></a>00544 {
<a name="l00545"></a>00545 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00546"></a>00546
<a name="l00547"></a>00547 _dbus_assert (<span class="keyword">sizeof</span> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a>) == <span class="keyword">sizeof</span> (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>));
<a name="l00548"></a>00548
<a name="l00549"></a>00549 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00550"></a>00550
<a name="l00551"></a>00551 <span class="comment">/* if this assertion failed someone probably added hash entries</span>
<a name="l00552"></a>00552 <span class="comment"> * during iteration, which is bad.</span>
<a name="l00553"></a>00553 <span class="comment"> */</span>
<a name="l00554"></a>00554 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a84f2a189ee1eb3e51a8089b798a7797a" title="used to detect table resize since initialization">n_entries_on_init</a> >= real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a>-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a>);
<a name="l00555"></a>00555
<a name="l00556"></a>00556 <span class="comment">/* Remember that real->entry may have been deleted */</span>
<a name="l00557"></a>00557
<a name="l00558"></a>00558 <span class="keywordflow">while</span> (real-><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a> == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00559"></a>00559 {
<a name="l00560"></a>00560 <span class="keywordflow">if</span> (real-><a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824" title="index of next bucket">next_bucket</a> >= real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a>-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a>)
<a name="l00561"></a>00561 {
<a name="l00562"></a>00562 <span class="comment">/* invalidate iter and return false */</span>
<a name="l00563"></a>00563 real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00564"></a>00564 real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00565"></a>00565 real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a> = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00566"></a>00566 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>;
<a name="l00567"></a>00567 }
<a name="l00568"></a>00568
<a name="l00569"></a>00569 real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a> = &(real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a>-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[real-><a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824" title="index of next bucket">next_bucket</a>]);
<a name="l00570"></a>00570 real-><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a> = *(real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a>);
<a name="l00571"></a>00571 real-><a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824" title="index of next bucket">next_bucket</a> += 1;
<a name="l00572"></a>00572 }
<a name="l00573"></a>00573
<a name="l00574"></a>00574 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00575"></a>00575 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00576"></a>00576
<a name="l00577"></a>00577 real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> = real-><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a>;
<a name="l00578"></a>00578 real-><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a> = real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00579"></a>00579
<a name="l00580"></a>00580 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l00581"></a>00581 }
<a name="l00582"></a>00582
<a name="l00591"></a>00591 <span class="keywordtype">void</span>
<a name="l00592"></a><a class="code" href="group__DBusHashTable.html#ga0ef12d773a546f070cff91cbf1e8d16e">00592</a> <a class="code" href="group__DBusHashTable.html#ga0ef12d773a546f070cff91cbf1e8d16e" title="Removes the current entry from the hash table.">_dbus_hash_iter_remove_entry</a> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00593"></a>00593 {
<a name="l00594"></a>00594 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00595"></a>00595
<a name="l00596"></a>00596 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00597"></a>00597
<a name="l00598"></a>00598 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00599"></a>00599 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00600"></a>00600 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00601"></a>00601
<a name="l00602"></a>00602 remove_entry (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a>, real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a>, real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>);
<a name="l00603"></a>00603
<a name="l00604"></a>00604 real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>; <span class="comment">/* make it crash if you try to use this entry */</span>
<a name="l00605"></a>00605 }
<a name="l00606"></a>00606
<a name="l00612"></a>00612 <span class="keywordtype">void</span>*
<a name="l00613"></a><a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5">00613</a> <a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5" title="Gets the value of the current entry.">_dbus_hash_iter_get_value</a> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00614"></a>00614 {
<a name="l00615"></a>00615 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00616"></a>00616
<a name="l00617"></a>00617 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00618"></a>00618
<a name="l00619"></a>00619 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00620"></a>00620 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00621"></a>00621
<a name="l00622"></a>00622 <span class="keywordflow">return</span> real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>;
<a name="l00623"></a>00623 }
<a name="l00624"></a>00624
<a name="l00635"></a>00635 <span class="keywordtype">void</span>
<a name="l00636"></a><a class="code" href="group__DBusHashTable.html#ga24193343c0948019d4a302fc18bfd5d9">00636</a> <a class="code" href="group__DBusHashTable.html#ga24193343c0948019d4a302fc18bfd5d9" title="Sets the value of the current entry.">_dbus_hash_iter_set_value</a> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter,
<a name="l00637"></a>00637 <span class="keywordtype">void</span> *value)
<a name="l00638"></a>00638 {
<a name="l00639"></a>00639 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00640"></a>00640
<a name="l00641"></a>00641 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00642"></a>00642
<a name="l00643"></a>00643 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00644"></a>00644 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00645"></a>00645
<a name="l00646"></a>00646 <span class="keywordflow">if</span> (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a>-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a> && value != real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>)
<a name="l00647"></a>00647 (* real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a>-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a>) (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>);
<a name="l00648"></a>00648
<a name="l00649"></a>00649 real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a> = value;
<a name="l00650"></a>00650 }
<a name="l00651"></a>00651
<a name="l00658"></a>00658 <span class="keywordtype">int</span>
<a name="l00659"></a><a class="code" href="group__DBusHashTable.html#ga7a1b9fd35f9f7bdd86f9d71a6379053f">00659</a> <a class="code" href="group__DBusHashTable.html#ga7a1b9fd35f9f7bdd86f9d71a6379053f" title="Gets the key for the current entry.">_dbus_hash_iter_get_int_key</a> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00660"></a>00660 {
<a name="l00661"></a>00661 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00662"></a>00662
<a name="l00663"></a>00663 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00664"></a>00664
<a name="l00665"></a>00665 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00666"></a>00666 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00667"></a>00667
<a name="l00668"></a>00668 <span class="keywordflow">return</span> _DBUS_POINTER_TO_INT (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>);
<a name="l00669"></a>00669 }
<a name="l00670"></a>00670
<a name="l00677"></a>00677 uintptr_t
<a name="l00678"></a><a class="code" href="group__DBusHashTable.html#gaab14d583840d0a1b5c829d76959dcbf0">00678</a> <a class="code" href="group__DBusHashTable.html#gaab14d583840d0a1b5c829d76959dcbf0" title="Gets the key for the current entry.">_dbus_hash_iter_get_uintptr_key</a> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00679"></a>00679 {
<a name="l00680"></a>00680 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00681"></a>00681
<a name="l00682"></a>00682 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00683"></a>00683
<a name="l00684"></a>00684 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00685"></a>00685 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00686"></a>00686
<a name="l00687"></a>00687 <span class="keywordflow">return</span> (uintptr_t) real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>;
<a name="l00688"></a>00688 }
<a name="l00689"></a>00689
<a name="l00695"></a>00695 <span class="keyword">const</span> <span class="keywordtype">char</span>*
<a name="l00696"></a><a class="code" href="group__DBusHashTable.html#gaa0cff082174b1ab0380902ce4ae43d08">00696</a> <a class="code" href="group__DBusHashTable.html#gaa0cff082174b1ab0380902ce4ae43d08" title="Gets the key for the current entry.">_dbus_hash_iter_get_string_key</a> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00697"></a>00697 {
<a name="l00698"></a>00698 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00699"></a>00699
<a name="l00700"></a>00700 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00701"></a>00701
<a name="l00702"></a>00702 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00703"></a>00703 _dbus_assert (real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00704"></a>00704
<a name="l00705"></a>00705 <span class="keywordflow">return</span> real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a>-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>;
<a name="l00706"></a>00706 }
<a name="l00707"></a>00707
<a name="l00739"></a>00739 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l00740"></a><a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb">00740</a> <a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb" title="A low-level but efficient interface for manipulating the hash table.">_dbus_hash_iter_lookup</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00741"></a>00741 <span class="keywordtype">void</span> *key,
<a name="l00742"></a>00742 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> create_if_not_found,
<a name="l00743"></a>00743 <a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> *iter)
<a name="l00744"></a>00744 {
<a name="l00745"></a>00745 <a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a> *real;
<a name="l00746"></a>00746 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l00747"></a>00747 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket;
<a name="l00748"></a>00748
<a name="l00749"></a>00749 _dbus_assert (<span class="keyword">sizeof</span> (<a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a>) == <span class="keyword">sizeof</span> (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>));
<a name="l00750"></a>00750
<a name="l00751"></a>00751 real = (<a class="code" href="structDBusRealHashIter.html" title="Internals of DBusHashIter.">DBusRealHashIter</a>*) iter;
<a name="l00752"></a>00752
<a name="l00753"></a>00753 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, key, create_if_not_found, &bucket, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l00754"></a>00754
<a name="l00755"></a>00755 <span class="keywordflow">if</span> (entry == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00756"></a>00756 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>;
<a name="l00757"></a>00757
<a name="l00758"></a>00758 real-><a class="code" href="structDBusRealHashIter.html#a0307c2b8fa9384554ceb3cc965b04633" title="Pointer to table containing entry.">table</a> = table;
<a name="l00759"></a>00759 real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a> = bucket;
<a name="l00760"></a>00760 real-><a class="code" href="structDBusRealHashIter.html#a438db1cb3a9c6db716f8bf35fe3054c7" title="Current hash entry.">entry</a> = entry;
<a name="l00761"></a>00761 real-><a class="code" href="structDBusRealHashIter.html#a056417c3726f4f98eb94a9d2784a59e0" title="Next entry to be iterated onto in current bucket.">next_entry</a> = entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00762"></a>00762 real-><a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824" title="index of next bucket">next_bucket</a> = (bucket - table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>) + 1;
<a name="l00763"></a>00763 real-><a class="code" href="structDBusRealHashIter.html#a84f2a189ee1eb3e51a8089b798a7797a" title="used to detect table resize since initialization">n_entries_on_init</a> = table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a>;
<a name="l00764"></a>00764
<a name="l00765"></a>00765 _dbus_assert (&(table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[real-><a class="code" href="structDBusRealHashIter.html#adbf758933299ee6305c525ea0fe74824" title="index of next bucket">next_bucket</a>-1]) == real-><a class="code" href="structDBusRealHashIter.html#ad36967dc68709d676ad591d7f75dd7fa" title="Pointer to bucket that points to first entry in this entry's chain: used for deleting the entry...">bucket</a>);
<a name="l00766"></a>00766
<a name="l00767"></a>00767 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l00768"></a>00768 }
<a name="l00769"></a>00769
<a name="l00770"></a>00770 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00771"></a>00771 add_allocated_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00772"></a>00772 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry,
<a name="l00773"></a>00773 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx,
<a name="l00774"></a>00774 <span class="keywordtype">void</span> *key,
<a name="l00775"></a>00775 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket)
<a name="l00776"></a>00776 {
<a name="l00777"></a>00777 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **b;
<a name="l00778"></a>00778
<a name="l00779"></a>00779 entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a> = key;
<a name="l00780"></a>00780
<a name="l00781"></a>00781 b = &(table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[idx]);
<a name="l00782"></a>00782 entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a> = *b;
<a name="l00783"></a>00783 *b = entry;
<a name="l00784"></a>00784
<a name="l00785"></a>00785 <span class="keywordflow">if</span> (bucket)
<a name="l00786"></a>00786 *bucket = b;
<a name="l00787"></a>00787
<a name="l00788"></a>00788 table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a> += 1;
<a name="l00789"></a>00789
<a name="l00790"></a>00790 <span class="comment">/* note we ONLY rebuild when ADDING - because you can iterate over a</span>
<a name="l00791"></a>00791 <span class="comment"> * table and remove entries safely.</span>
<a name="l00792"></a>00792 <span class="comment"> */</span>
<a name="l00793"></a>00793 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a> >= table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a> ||
<a name="l00794"></a>00794 table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a> < table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a>)
<a name="l00795"></a>00795 rebuild_table (table);
<a name="l00796"></a>00796 }
<a name="l00797"></a>00797
<a name="l00798"></a>00798 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*
<a name="l00799"></a>00799 add_entry (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00800"></a>00800 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx,
<a name="l00801"></a>00801 <span class="keywordtype">void</span> *key,
<a name="l00802"></a>00802 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket,
<a name="l00803"></a>00803 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated)
<a name="l00804"></a>00804 {
<a name="l00805"></a>00805 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l00806"></a>00806
<a name="l00807"></a>00807 <span class="keywordflow">if</span> (preallocated == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00808"></a>00808 {
<a name="l00809"></a>00809 entry = alloc_entry (table);
<a name="l00810"></a>00810 <span class="keywordflow">if</span> (entry == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00811"></a>00811 {
<a name="l00812"></a>00812 <span class="keywordflow">if</span> (bucket)
<a name="l00813"></a>00813 *bucket = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00814"></a>00814 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00815"></a>00815 }
<a name="l00816"></a>00816 }
<a name="l00817"></a>00817 <span class="keywordflow">else</span>
<a name="l00818"></a>00818 {
<a name="l00819"></a>00819 entry = (<a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*) preallocated;
<a name="l00820"></a>00820 }
<a name="l00821"></a>00821
<a name="l00822"></a>00822 add_allocated_entry (table, entry, idx, key, bucket);
<a name="l00823"></a>00823
<a name="l00824"></a>00824 <span class="keywordflow">return</span> entry;
<a name="l00825"></a>00825 }
<a name="l00826"></a>00826
<a name="l00827"></a>00827 <span class="comment">/* This is g_str_hash from GLib which was</span>
<a name="l00828"></a>00828 <span class="comment"> * extensively discussed/tested/profiled</span>
<a name="l00829"></a>00829 <span class="comment"> */</span>
<a name="l00830"></a>00830 <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00831"></a>00831 string_hash (<span class="keyword">const</span> <span class="keywordtype">char</span> *str)
<a name="l00832"></a>00832 {
<a name="l00833"></a>00833 <span class="keyword">const</span> <span class="keywordtype">char</span> *p = str;
<a name="l00834"></a>00834 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> h = *p;
<a name="l00835"></a>00835
<a name="l00836"></a>00836 <span class="keywordflow">if</span> (h)
<a name="l00837"></a>00837 <span class="keywordflow">for</span> (p += 1; *p != <span class="charliteral">'\0'</span>; p++)
<a name="l00838"></a>00838 h = (h << 5) - h + *p;
<a name="l00839"></a>00839
<a name="l00840"></a>00840 <span class="keywordflow">return</span> h;
<a name="l00841"></a>00841 }
<a name="l00842"></a>00842
<a name="l00844"></a><a class="code" href="group__DBusHashTable.html#gaa76f90a33882453d9eadcb270c96df92">00844</a> <span class="keyword">typedef</span> int (* <a class="code" href="group__DBusHashTable.html#gaa76f90a33882453d9eadcb270c96df92" title="Key comparison function.">KeyCompareFunc</a>) (<span class="keyword">const</span> <span class="keywordtype">void</span> *key_a, <span class="keyword">const</span> <span class="keywordtype">void</span> *key_b);
<a name="l00845"></a>00845
<a name="l00846"></a>00846 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*
<a name="l00847"></a>00847 find_generic_function (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00848"></a>00848 <span class="keywordtype">void</span> *key,
<a name="l00849"></a>00849 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx,
<a name="l00850"></a>00850 <a class="code" href="group__DBusHashTable.html#gaa76f90a33882453d9eadcb270c96df92" title="Key comparison function.">KeyCompareFunc</a> compare_func,
<a name="l00851"></a>00851 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> create_if_not_found,
<a name="l00852"></a>00852 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket,
<a name="l00853"></a>00853 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated)
<a name="l00854"></a>00854 {
<a name="l00855"></a>00855 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l00856"></a>00856
<a name="l00857"></a>00857 <span class="keywordflow">if</span> (bucket)
<a name="l00858"></a>00858 *bucket = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l00859"></a>00859
<a name="l00860"></a>00860 <span class="comment">/* Search all of the entries in this bucket. */</span>
<a name="l00861"></a>00861 entry = table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[idx];
<a name="l00862"></a>00862 <span class="keywordflow">while</span> (entry != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00863"></a>00863 {
<a name="l00864"></a>00864 <span class="keywordflow">if</span> ((compare_func == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a> && key == entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>) ||
<a name="l00865"></a>00865 (compare_func != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a> && (* compare_func) (key, entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>) == 0))
<a name="l00866"></a>00866 {
<a name="l00867"></a>00867 <span class="keywordflow">if</span> (bucket)
<a name="l00868"></a>00868 *bucket = &(table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[idx]);
<a name="l00869"></a>00869
<a name="l00870"></a>00870 <span class="keywordflow">if</span> (preallocated)
<a name="l00871"></a>00871 <a class="code" href="group__DBusHashTable.html#ga159dfec03d53e6e2ff485fc83aed2552" title="Frees an opaque DBusPreallocatedHash that was *not* used in order to insert into the hash table...">_dbus_hash_table_free_preallocated_entry</a> (table, preallocated);
<a name="l00872"></a>00872
<a name="l00873"></a>00873 <span class="keywordflow">return</span> entry;
<a name="l00874"></a>00874 }
<a name="l00875"></a>00875
<a name="l00876"></a>00876 entry = entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l00877"></a>00877 }
<a name="l00878"></a>00878
<a name="l00879"></a>00879 <span class="keywordflow">if</span> (create_if_not_found)
<a name="l00880"></a>00880 entry = add_entry (table, idx, key, bucket, preallocated);
<a name="l00881"></a>00881 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (preallocated)
<a name="l00882"></a>00882 <a class="code" href="group__DBusHashTable.html#ga159dfec03d53e6e2ff485fc83aed2552" title="Frees an opaque DBusPreallocatedHash that was *not* used in order to insert into the hash table...">_dbus_hash_table_free_preallocated_entry</a> (table, preallocated);
<a name="l00883"></a>00883
<a name="l00884"></a>00884 <span class="keywordflow">return</span> entry;
<a name="l00885"></a>00885 }
<a name="l00886"></a>00886
<a name="l00887"></a>00887 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*
<a name="l00888"></a>00888 find_string_function (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00889"></a>00889 <span class="keywordtype">void</span> *key,
<a name="l00890"></a>00890 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> create_if_not_found,
<a name="l00891"></a>00891 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket,
<a name="l00892"></a>00892 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated)
<a name="l00893"></a>00893 {
<a name="l00894"></a>00894 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx;
<a name="l00895"></a>00895
<a name="l00896"></a>00896 idx = string_hash (key) & table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a>;
<a name="l00897"></a>00897
<a name="l00898"></a>00898 <span class="keywordflow">return</span> find_generic_function (table, key, idx,
<a name="l00899"></a>00899 (<a class="code" href="group__DBusHashTable.html#gaa76f90a33882453d9eadcb270c96df92" title="Key comparison function.">KeyCompareFunc</a>) strcmp, create_if_not_found, bucket,
<a name="l00900"></a>00900 preallocated);
<a name="l00901"></a>00901 }
<a name="l00902"></a>00902
<a name="l00903"></a>00903 <span class="keyword">static</span> <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*
<a name="l00904"></a>00904 find_direct_function (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l00905"></a>00905 <span class="keywordtype">void</span> *key,
<a name="l00906"></a>00906 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> create_if_not_found,
<a name="l00907"></a>00907 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> ***bucket,
<a name="l00908"></a>00908 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated)
<a name="l00909"></a>00909 {
<a name="l00910"></a>00910 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx;
<a name="l00911"></a>00911
<a name="l00912"></a>00912 idx = <a class="code" href="group__DBusHashTableInternals.html#ga9dc8fd5a9e25bd2b229366a683ff78f9" title="Takes a preliminary integer hash value and produces an index into a hash tables bucket list...">RANDOM_INDEX</a> (table, key) & table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a>;
<a name="l00913"></a>00913
<a name="l00914"></a>00914
<a name="l00915"></a>00915 <span class="keywordflow">return</span> find_generic_function (table, key, idx,
<a name="l00916"></a>00916 <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, create_if_not_found, bucket,
<a name="l00917"></a>00917 preallocated);
<a name="l00918"></a>00918 }
<a name="l00919"></a>00919
<a name="l00920"></a>00920 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00921"></a>00921 rebuild_table (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l00922"></a>00922 {
<a name="l00923"></a>00923 <span class="keywordtype">int</span> old_size;
<a name="l00924"></a>00924 <span class="keywordtype">int</span> new_buckets;
<a name="l00925"></a>00925 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **old_buckets;
<a name="l00926"></a>00926 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **old_chain;
<a name="l00927"></a>00927 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l00928"></a>00928 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> growing;
<a name="l00929"></a>00929
<a name="l00930"></a>00930 <span class="comment">/*</span>
<a name="l00931"></a>00931 <span class="comment"> * Allocate and initialize the new bucket array, and set up</span>
<a name="l00932"></a>00932 <span class="comment"> * hashing constants for new array size.</span>
<a name="l00933"></a>00933 <span class="comment"> */</span>
<a name="l00934"></a>00934
<a name="l00935"></a>00935 growing = table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a> >= table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a>;
<a name="l00936"></a>00936
<a name="l00937"></a>00937 old_size = table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a>;
<a name="l00938"></a>00938 old_buckets = table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>;
<a name="l00939"></a>00939
<a name="l00940"></a>00940 <span class="keywordflow">if</span> (growing)
<a name="l00941"></a>00941 {
<a name="l00942"></a>00942 <span class="comment">/* overflow paranoia */</span>
<a name="l00943"></a>00943 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a> < _DBUS_INT_MAX / 4 &&
<a name="l00944"></a>00944 table-><a class="code" href="structDBusHashTable.html#a2e7e7b92bb9633ab95cfaa592b89025c" title="Shift count used in hashing function.">down_shift</a> >= 0)
<a name="l00945"></a>00945 new_buckets = table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a> * 4;
<a name="l00946"></a>00946 <span class="keywordflow">else</span>
<a name="l00947"></a>00947 <span class="keywordflow">return</span>; <span class="comment">/* can't grow anymore */</span>
<a name="l00948"></a>00948 }
<a name="l00949"></a>00949 <span class="keywordflow">else</span>
<a name="l00950"></a>00950 {
<a name="l00951"></a>00951 new_buckets = table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a> / 4;
<a name="l00952"></a>00952 <span class="keywordflow">if</span> (new_buckets < <a class="code" href="group__DBusHashTableInternals.html#ga4518324f3c3caacf5694065f4f6071d8" title="Initial number of buckets in hash table (hash table statically allocates its buckets for this size an...">DBUS_SMALL_HASH_TABLE</a>)
<a name="l00953"></a>00953 <span class="keywordflow">return</span>; <span class="comment">/* don't bother shrinking this far */</span>
<a name="l00954"></a>00954 }
<a name="l00955"></a>00955
<a name="l00956"></a>00956 table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a> = <a class="code" href="group__DBusMemory.html#gaba9d823abda7f4cadbaf5177d3b8b793" title="Safe macro for using dbus_malloc0().">dbus_new0</a> (<a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*, new_buckets);
<a name="l00957"></a>00957 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a> == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l00958"></a>00958 {
<a name="l00959"></a>00959 <span class="comment">/* out of memory, yay - just don't reallocate, the table will</span>
<a name="l00960"></a>00960 <span class="comment"> * still work, albeit more slowly.</span>
<a name="l00961"></a>00961 <span class="comment"> */</span>
<a name="l00962"></a>00962 table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a> = old_buckets;
<a name="l00963"></a>00963 <span class="keywordflow">return</span>;
<a name="l00964"></a>00964 }
<a name="l00965"></a>00965
<a name="l00966"></a>00966 table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a> = new_buckets;
<a name="l00967"></a>00967
<a name="l00968"></a>00968 <span class="keywordflow">if</span> (growing)
<a name="l00969"></a>00969 {
<a name="l00970"></a>00970 table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a> = table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a>;
<a name="l00971"></a>00971 table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a> *= 4;
<a name="l00972"></a>00972
<a name="l00973"></a>00973 table-><a class="code" href="structDBusHashTable.html#a2e7e7b92bb9633ab95cfaa592b89025c" title="Shift count used in hashing function.">down_shift</a> -= 2; <span class="comment">/* keep 2 more high bits */</span>
<a name="l00974"></a>00974 table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> = (table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> << 2) + 3; <span class="comment">/* keep 2 more high bits */</span>
<a name="l00975"></a>00975 }
<a name="l00976"></a>00976 <span class="keywordflow">else</span>
<a name="l00977"></a>00977 {
<a name="l00978"></a>00978 table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a> = table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a>;
<a name="l00979"></a>00979 table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a> /= 4;
<a name="l00980"></a>00980
<a name="l00981"></a>00981 table-><a class="code" href="structDBusHashTable.html#a2e7e7b92bb9633ab95cfaa592b89025c" title="Shift count used in hashing function.">down_shift</a> += 2; <span class="comment">/* keep 2 fewer high bits */</span>
<a name="l00982"></a>00982 table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> = table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> >> 2; <span class="comment">/* keep 2 fewer high bits */</span>
<a name="l00983"></a>00983 }
<a name="l00984"></a>00984
<a name="l00985"></a>00985 <span class="preprocessor">#if 0</span>
<a name="l00986"></a>00986 <span class="preprocessor"></span> printf (<span class="stringliteral">"%s table to lo = %d hi = %d downshift = %d mask = 0x%x\n"</span>,
<a name="l00987"></a>00987 growing ? <span class="stringliteral">"GROW"</span> : <span class="stringliteral">"SHRINK"</span>,
<a name="l00988"></a>00988 table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a>,
<a name="l00989"></a>00989 table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a>,
<a name="l00990"></a>00990 table-><a class="code" href="structDBusHashTable.html#a2e7e7b92bb9633ab95cfaa592b89025c" title="Shift count used in hashing function.">down_shift</a>,
<a name="l00991"></a>00991 table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a>);
<a name="l00992"></a>00992 <span class="preprocessor">#endif</span>
<a name="l00993"></a>00993 <span class="preprocessor"></span>
<a name="l00994"></a>00994 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a> >= 0);
<a name="l00995"></a>00995 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a29c408110c0d189d89b60c6c01cfb0cf" title="Enlarge table when n_entries gets to be this large.">hi_rebuild_size</a> > table-><a class="code" href="structDBusHashTable.html#aae6ea7cb15d618866854b2b6bd468419" title="Shrink table when n_entries gets below this.">lo_rebuild_size</a>);
<a name="l00996"></a>00996 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> != 0);
<a name="l00997"></a>00997 <span class="comment">/* the mask is essentially the max index */</span>
<a name="l00998"></a>00998 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a> < table-><a class="code" href="structDBusHashTable.html#a2dd2b9389d65d30e31e596dd786a9aa7" title="Total number of buckets allocated at **buckets.">n_buckets</a>);
<a name="l00999"></a>00999
<a name="l01000"></a>01000 <span class="comment">/*</span>
<a name="l01001"></a>01001 <span class="comment"> * Rehash all of the existing entries into the new bucket array.</span>
<a name="l01002"></a>01002 <span class="comment"> */</span>
<a name="l01003"></a>01003
<a name="l01004"></a>01004 <span class="keywordflow">for</span> (old_chain = old_buckets; old_size > 0; old_size--, old_chain++)
<a name="l01005"></a>01005 {
<a name="l01006"></a>01006 <span class="keywordflow">for</span> (entry = *old_chain; entry != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>; entry = *old_chain)
<a name="l01007"></a>01007 {
<a name="l01008"></a>01008 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx;
<a name="l01009"></a>01009 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket;
<a name="l01010"></a>01010
<a name="l01011"></a>01011 *old_chain = entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a>;
<a name="l01012"></a>01012 <span class="keywordflow">switch</span> (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a>)
<a name="l01013"></a>01013 {
<a name="l01014"></a>01014 <span class="keywordflow">case</span> <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>:
<a name="l01015"></a>01015 idx = string_hash (entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>) & table-><a class="code" href="structDBusHashTable.html#aec1230eebce3d256ca9ceebe372647e9" title="Mask value used in hashing function.">mask</a>;
<a name="l01016"></a>01016 <span class="keywordflow">break</span>;
<a name="l01017"></a>01017 <span class="keywordflow">case</span> <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>:
<a name="l01018"></a>01018 <span class="keywordflow">case</span> <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a477caf35cc3676d6412c9b57f1d0f6c7" title="Hash keys are integer capable to hold a pointer.">DBUS_HASH_UINTPTR</a>:
<a name="l01019"></a>01019 idx = <a class="code" href="group__DBusHashTableInternals.html#ga9dc8fd5a9e25bd2b229366a683ff78f9" title="Takes a preliminary integer hash value and produces an index into a hash tables bucket list...">RANDOM_INDEX</a> (table, entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>);
<a name="l01020"></a>01020 <span class="keywordflow">break</span>;
<a name="l01021"></a>01021 <span class="keywordflow">default</span>:
<a name="l01022"></a>01022 idx = 0;
<a name="l01023"></a>01023 _dbus_assert_not_reached (<span class="stringliteral">"Unknown hash table type"</span>);
<a name="l01024"></a>01024 <span class="keywordflow">break</span>;
<a name="l01025"></a>01025 }
<a name="l01026"></a>01026
<a name="l01027"></a>01027 bucket = &(table-><a class="code" href="structDBusHashTable.html#a1f974e2cb3038685b3edf493406ad99d" title="Pointer to bucket array.">buckets</a>[idx]);
<a name="l01028"></a>01028 entry-><a class="code" href="structDBusHashEntry.html#ae986e25c0b24237f9848ff43aa1d8501" title="Pointer to next entry in this hash bucket, or NULL for end of chain.">next</a> = *bucket;
<a name="l01029"></a>01029 *bucket = entry;
<a name="l01030"></a>01030 }
<a name="l01031"></a>01031 }
<a name="l01032"></a>01032
<a name="l01033"></a>01033 <span class="comment">/* Free the old bucket array, if it was dynamically allocated. */</span>
<a name="l01034"></a>01034
<a name="l01035"></a>01035 <span class="keywordflow">if</span> (old_buckets != table-><a class="code" href="structDBusHashTable.html#af71877d64657c34a783caf6b82b016e9" title="Bucket array used for small tables (to avoid mallocs and frees).">static_buckets</a>)
<a name="l01036"></a>01036 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a> (old_buckets);
<a name="l01037"></a>01037 }
<a name="l01038"></a>01038
<a name="l01048"></a>01048 <span class="keywordtype">void</span>*
<a name="l01049"></a><a class="code" href="group__DBusHashTable.html#gad51eb3fe682721dd4f6a920ca87cb730">01049</a> <a class="code" href="group__DBusHashTable.html#gad51eb3fe682721dd4f6a920ca87cb730" title="Looks up the value for a given string in a hash table of type DBUS_HASH_STRING.">_dbus_hash_table_lookup_string</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01050"></a>01050 <span class="keyword">const</span> <span class="keywordtype">char</span> *key)
<a name="l01051"></a>01051 {
<a name="l01052"></a>01052 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01053"></a>01053
<a name="l01054"></a>01054 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>);
<a name="l01055"></a>01055
<a name="l01056"></a>01056 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, (<span class="keywordtype">char</span>*) key, <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01057"></a>01057
<a name="l01058"></a>01058 <span class="keywordflow">if</span> (entry)
<a name="l01059"></a>01059 <span class="keywordflow">return</span> entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>;
<a name="l01060"></a>01060 <span class="keywordflow">else</span>
<a name="l01061"></a>01061 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l01062"></a>01062 }
<a name="l01063"></a>01063
<a name="l01073"></a>01073 <span class="keywordtype">void</span>*
<a name="l01074"></a><a class="code" href="group__DBusHashTable.html#ga36ff49c4c35599e6fcdadc7f6805c49e">01074</a> <a class="code" href="group__DBusHashTable.html#ga36ff49c4c35599e6fcdadc7f6805c49e" title="Looks up the value for a given integer in a hash table of type DBUS_HASH_INT.">_dbus_hash_table_lookup_int</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01075"></a>01075 <span class="keywordtype">int</span> key)
<a name="l01076"></a>01076 {
<a name="l01077"></a>01077 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01078"></a>01078
<a name="l01079"></a>01079 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>);
<a name="l01080"></a>01080
<a name="l01081"></a>01081 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, _DBUS_INT_TO_POINTER (key), <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01082"></a>01082
<a name="l01083"></a>01083 <span class="keywordflow">if</span> (entry)
<a name="l01084"></a>01084 <span class="keywordflow">return</span> entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>;
<a name="l01085"></a>01085 <span class="keywordflow">else</span>
<a name="l01086"></a>01086 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l01087"></a>01087 }
<a name="l01088"></a>01088
<a name="l01098"></a>01098 <span class="keywordtype">void</span>*
<a name="l01099"></a><a class="code" href="group__DBusHashTable.html#gae0ac411f87a797767f36c6e64fd807b3">01099</a> <a class="code" href="group__DBusHashTable.html#gae0ac411f87a797767f36c6e64fd807b3" title="Looks up the value for a given integer in a hash table of type DBUS_HASH_UINTPTR.">_dbus_hash_table_lookup_uintptr</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01100"></a>01100 uintptr_t key)
<a name="l01101"></a>01101 {
<a name="l01102"></a>01102 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01103"></a>01103
<a name="l01104"></a>01104 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a477caf35cc3676d6412c9b57f1d0f6c7" title="Hash keys are integer capable to hold a pointer.">DBUS_HASH_UINTPTR</a>);
<a name="l01105"></a>01105
<a name="l01106"></a>01106 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, (<span class="keywordtype">void</span>*) key, <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01107"></a>01107
<a name="l01108"></a>01108 <span class="keywordflow">if</span> (entry)
<a name="l01109"></a>01109 <span class="keywordflow">return</span> entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>;
<a name="l01110"></a>01110 <span class="keywordflow">else</span>
<a name="l01111"></a>01111 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l01112"></a>01112 }
<a name="l01113"></a>01113
<a name="l01122"></a>01122 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l01123"></a><a class="code" href="group__DBusHashTable.html#ga388d50ce1a07bf0790b9f2ecdb08a396">01123</a> <a class="code" href="group__DBusHashTable.html#ga388d50ce1a07bf0790b9f2ecdb08a396" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_string</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01124"></a>01124 <span class="keyword">const</span> <span class="keywordtype">char</span> *key)
<a name="l01125"></a>01125 {
<a name="l01126"></a>01126 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01127"></a>01127 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket;
<a name="l01128"></a>01128
<a name="l01129"></a>01129 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>);
<a name="l01130"></a>01130
<a name="l01131"></a>01131 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, (<span class="keywordtype">char</span>*) key, <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, &bucket, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01132"></a>01132
<a name="l01133"></a>01133 <span class="keywordflow">if</span> (entry)
<a name="l01134"></a>01134 {
<a name="l01135"></a>01135 remove_entry (table, bucket, entry);
<a name="l01136"></a>01136 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l01137"></a>01137 }
<a name="l01138"></a>01138 <span class="keywordflow">else</span>
<a name="l01139"></a>01139 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>;
<a name="l01140"></a>01140 }
<a name="l01141"></a>01141
<a name="l01150"></a>01150 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l01151"></a><a class="code" href="group__DBusHashTable.html#gacdebe75bd692605a69dc73c15e0eefd0">01151</a> <a class="code" href="group__DBusHashTable.html#gacdebe75bd692605a69dc73c15e0eefd0" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_int</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01152"></a>01152 <span class="keywordtype">int</span> key)
<a name="l01153"></a>01153 {
<a name="l01154"></a>01154 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01155"></a>01155 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket;
<a name="l01156"></a>01156
<a name="l01157"></a>01157 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>);
<a name="l01158"></a>01158
<a name="l01159"></a>01159 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, _DBUS_INT_TO_POINTER (key), <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, &bucket, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01160"></a>01160
<a name="l01161"></a>01161 <span class="keywordflow">if</span> (entry)
<a name="l01162"></a>01162 {
<a name="l01163"></a>01163 remove_entry (table, bucket, entry);
<a name="l01164"></a>01164 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l01165"></a>01165 }
<a name="l01166"></a>01166 <span class="keywordflow">else</span>
<a name="l01167"></a>01167 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>;
<a name="l01168"></a>01168 }
<a name="l01169"></a>01169
<a name="l01178"></a>01178 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l01179"></a><a class="code" href="group__DBusHashTable.html#ga0ad8fa1108bad2b4bd5b4ce539d32d64">01179</a> <a class="code" href="group__DBusHashTable.html#ga0ad8fa1108bad2b4bd5b4ce539d32d64" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_uintptr</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01180"></a>01180 uintptr_t key)
<a name="l01181"></a>01181 {
<a name="l01182"></a>01182 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01183"></a>01183 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> **bucket;
<a name="l01184"></a>01184
<a name="l01185"></a>01185 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a477caf35cc3676d6412c9b57f1d0f6c7" title="Hash keys are integer capable to hold a pointer.">DBUS_HASH_UINTPTR</a>);
<a name="l01186"></a>01186
<a name="l01187"></a>01187 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, (<span class="keywordtype">void</span>*) key, <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, &bucket, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01188"></a>01188
<a name="l01189"></a>01189 <span class="keywordflow">if</span> (entry)
<a name="l01190"></a>01190 {
<a name="l01191"></a>01191 remove_entry (table, bucket, entry);
<a name="l01192"></a>01192 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l01193"></a>01193 }
<a name="l01194"></a>01194 <span class="keywordflow">else</span>
<a name="l01195"></a>01195 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>;
<a name="l01196"></a>01196 }
<a name="l01197"></a>01197
<a name="l01213"></a>01213 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l01214"></a><a class="code" href="group__DBusHashTable.html#ga43e98a91a11952824c544330e19f6c22">01214</a> <a class="code" href="group__DBusHashTable.html#ga43e98a91a11952824c544330e19f6c22" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_string</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01215"></a>01215 <span class="keywordtype">char</span> *key,
<a name="l01216"></a>01216 <span class="keywordtype">void</span> *value)
<a name="l01217"></a>01217 {
<a name="l01218"></a>01218 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated;
<a name="l01219"></a>01219
<a name="l01220"></a>01220 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>);
<a name="l01221"></a>01221
<a name="l01222"></a>01222 preallocated = <a class="code" href="group__DBusHashTable.html#ga7c2fed5599678e550af10eaa7fd5b1d1" title="Preallocate an opaque data blob that allows us to insert into the hash table at a later time without ...">_dbus_hash_table_preallocate_entry</a> (table);
<a name="l01223"></a>01223 <span class="keywordflow">if</span> (preallocated == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01224"></a>01224 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>;
<a name="l01225"></a>01225
<a name="l01226"></a>01226 <a class="code" href="group__DBusHashTable.html#ga770a9b786a9594350165b7224bd173ee" title="Inserts a string-keyed entry into the hash table, using a preallocated data block from _dbus_hash_tab...">_dbus_hash_table_insert_string_preallocated</a> (table, preallocated,
<a name="l01227"></a>01227 key, value);
<a name="l01228"></a>01228
<a name="l01229"></a>01229 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l01230"></a>01230 }
<a name="l01231"></a>01231
<a name="l01247"></a>01247 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l01248"></a><a class="code" href="group__DBusHashTable.html#gaca20a83f3214db08fa34df2c49c8edd5">01248</a> <a class="code" href="group__DBusHashTable.html#gaca20a83f3214db08fa34df2c49c8edd5" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_int</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01249"></a>01249 <span class="keywordtype">int</span> key,
<a name="l01250"></a>01250 <span class="keywordtype">void</span> *value)
<a name="l01251"></a>01251 {
<a name="l01252"></a>01252 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01253"></a>01253
<a name="l01254"></a>01254 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>);
<a name="l01255"></a>01255
<a name="l01256"></a>01256 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, _DBUS_INT_TO_POINTER (key), <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01257"></a>01257
<a name="l01258"></a>01258 <span class="keywordflow">if</span> (entry == NULL)
<a name="l01259"></a>01259 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>; <span class="comment">/* no memory */</span>
<a name="l01260"></a>01260
<a name="l01261"></a>01261 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a> && entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a> != _DBUS_INT_TO_POINTER (key))
<a name="l01262"></a>01262 (* table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>);
<a name="l01263"></a>01263
<a name="l01264"></a>01264 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a> && entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a> != value)
<a name="l01265"></a>01265 (* table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>);
<a name="l01266"></a>01266
<a name="l01267"></a>01267 entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a> = _DBUS_INT_TO_POINTER (key);
<a name="l01268"></a>01268 entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a> = value;
<a name="l01269"></a>01269
<a name="l01270"></a>01270 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l01271"></a>01271 }
<a name="l01272"></a>01272
<a name="l01288"></a>01288 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l01289"></a><a class="code" href="group__DBusHashTable.html#ga811d833032ca919a9063ca835482d01a">01289</a> <a class="code" href="group__DBusHashTable.html#ga811d833032ca919a9063ca835482d01a" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_uintptr</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01290"></a>01290 uintptr_t key,
<a name="l01291"></a>01291 <span class="keywordtype">void</span> *value)
<a name="l01292"></a>01292 {
<a name="l01293"></a>01293 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01294"></a>01294
<a name="l01295"></a>01295 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a477caf35cc3676d6412c9b57f1d0f6c7" title="Hash keys are integer capable to hold a pointer.">DBUS_HASH_UINTPTR</a>);
<a name="l01296"></a>01296
<a name="l01297"></a>01297 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, (<span class="keywordtype">void</span>*) key, <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01298"></a>01298
<a name="l01299"></a>01299 <span class="keywordflow">if</span> (entry == NULL)
<a name="l01300"></a>01300 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>; <span class="comment">/* no memory */</span>
<a name="l01301"></a>01301
<a name="l01302"></a>01302 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a> && entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a> != (<span class="keywordtype">void</span>*) key)
<a name="l01303"></a>01303 (* table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>);
<a name="l01304"></a>01304
<a name="l01305"></a>01305 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a> && entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a> != value)
<a name="l01306"></a>01306 (* table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>);
<a name="l01307"></a>01307
<a name="l01308"></a>01308 entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a> = (<span class="keywordtype">void</span>*) key;
<a name="l01309"></a>01309 entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a> = value;
<a name="l01310"></a>01310
<a name="l01311"></a>01311 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l01312"></a>01312 }
<a name="l01313"></a>01313
<a name="l01321"></a>01321 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a>*
<a name="l01322"></a><a class="code" href="group__DBusHashTable.html#ga7c2fed5599678e550af10eaa7fd5b1d1">01322</a> <a class="code" href="group__DBusHashTable.html#ga7c2fed5599678e550af10eaa7fd5b1d1" title="Preallocate an opaque data blob that allows us to insert into the hash table at a later time without ...">_dbus_hash_table_preallocate_entry</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l01323"></a>01323 {
<a name="l01324"></a>01324 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01325"></a>01325
<a name="l01326"></a>01326 entry = alloc_entry (table);
<a name="l01327"></a>01327
<a name="l01328"></a>01328 <span class="keywordflow">return</span> (<a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a>*) entry;
<a name="l01329"></a>01329 }
<a name="l01330"></a>01330
<a name="l01338"></a>01338 <span class="keywordtype">void</span>
<a name="l01339"></a><a class="code" href="group__DBusHashTable.html#ga159dfec03d53e6e2ff485fc83aed2552">01339</a> <a class="code" href="group__DBusHashTable.html#ga159dfec03d53e6e2ff485fc83aed2552" title="Frees an opaque DBusPreallocatedHash that was *not* used in order to insert into the hash table...">_dbus_hash_table_free_preallocated_entry</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01340"></a>01340 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated)
<a name="l01341"></a>01341 {
<a name="l01342"></a>01342 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01343"></a>01343
<a name="l01344"></a>01344 _dbus_assert (preallocated != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01345"></a>01345
<a name="l01346"></a>01346 entry = (<a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a>*) preallocated;
<a name="l01347"></a>01347
<a name="l01348"></a>01348 <span class="comment">/* Don't use free_entry(), since this entry has no key/data */</span>
<a name="l01349"></a>01349 <a class="code" href="group__DBusMemPool.html#ga4e2feaefee7384ed940059e6c7b0a9d5" title="Deallocates an object previously created with _dbus_mem_pool_alloc().">_dbus_mem_pool_dealloc</a> (table-><a class="code" href="structDBusHashTable.html#ad1224e6c3c632afb265b78f8f6e30f97" title="Memory pool for hash entries.">entry_pool</a>, entry);
<a name="l01350"></a>01350 }
<a name="l01351"></a>01351
<a name="l01365"></a>01365 <span class="keywordtype">void</span>
<a name="l01366"></a><a class="code" href="group__DBusHashTable.html#ga770a9b786a9594350165b7224bd173ee">01366</a> <a class="code" href="group__DBusHashTable.html#ga770a9b786a9594350165b7224bd173ee" title="Inserts a string-keyed entry into the hash table, using a preallocated data block from _dbus_hash_tab...">_dbus_hash_table_insert_string_preallocated</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table,
<a name="l01367"></a>01367 <a class="code" href="group__DBusHashTable.html#ga175dc6ab841ed32bb6acf6e4c0df36a8" title="A preallocated hash entry.">DBusPreallocatedHash</a> *preallocated,
<a name="l01368"></a>01368 <span class="keywordtype">char</span> *key,
<a name="l01369"></a>01369 <span class="keywordtype">void</span> *value)
<a name="l01370"></a>01370 {
<a name="l01371"></a>01371 <a class="code" href="structDBusHashEntry.html" title="Internal representation of a hash entry.">DBusHashEntry</a> *entry;
<a name="l01372"></a>01372
<a name="l01373"></a>01373 _dbus_assert (table-><a class="code" href="structDBusHashTable.html#a28f326a2947b6be0b0b852db376a1092" title="Type of keys used in this table.">key_type</a> == <a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>);
<a name="l01374"></a>01374 _dbus_assert (preallocated != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01375"></a>01375
<a name="l01376"></a>01376 entry = (* table-><a class="code" href="structDBusHashTable.html#ab98bafddf1b1ce1dad01c5595e278e35" title="Function for finding entries.">find_function</a>) (table, key, <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>, <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, preallocated);
<a name="l01377"></a>01377
<a name="l01378"></a>01378 _dbus_assert (entry != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01379"></a>01379
<a name="l01380"></a>01380 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a> && entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a> != key)
<a name="l01381"></a>01381 (* table-><a class="code" href="structDBusHashTable.html#a5f6541574ea8e6bedd80773dce8e52a6" title="Function to free keys.">free_key_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a>);
<a name="l01382"></a>01382
<a name="l01383"></a>01383 <span class="keywordflow">if</span> (table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a> && entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a> != value)
<a name="l01384"></a>01384 (* table-><a class="code" href="structDBusHashTable.html#afbb42b5326b9c79352b168eace1687ca" title="Function to free values.">free_value_function</a>) (entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a>);
<a name="l01385"></a>01385
<a name="l01386"></a>01386 entry-><a class="code" href="structDBusHashEntry.html#aefd9bbdcbc7d15c906e2c289c8d2e894" title="Hash key.">key</a> = key;
<a name="l01387"></a>01387 entry-><a class="code" href="structDBusHashEntry.html#ad792e9c81cc3a23859b2c60b3b00af3e" title="Hash value.">value</a> = value;
<a name="l01388"></a>01388 }
<a name="l01389"></a>01389
<a name="l01396"></a>01396 <span class="keywordtype">int</span>
<a name="l01397"></a><a class="code" href="group__DBusHashTable.html#gad48297fc27442c19a7c4bd4d1ef9ef77">01397</a> <a class="code" href="group__DBusHashTable.html#gad48297fc27442c19a7c4bd4d1ef9ef77" title="Gets the number of hash entries in a hash table.">_dbus_hash_table_get_n_entries</a> (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l01398"></a>01398 {
<a name="l01399"></a>01399 <span class="keywordflow">return</span> table-><a class="code" href="structDBusHashTable.html#affbf11a9c3dd72d55b7976891f7b4650" title="Total number of entries present in table.">n_entries</a>;
<a name="l01400"></a>01400 }
<a name="l01401"></a>01401
<a name="l01404"></a>01404 <span class="preprocessor">#ifdef DBUS_ENABLE_EMBEDDED_TESTS</span>
<a name="l01405"></a>01405 <span class="preprocessor"></span><span class="preprocessor">#include "dbus-test.h"</span>
<a name="l01406"></a>01406 <span class="preprocessor">#include <stdio.h></span>
<a name="l01407"></a>01407
<a name="l01408"></a>01408 <span class="comment">/* If you're wondering why the hash table test takes</span>
<a name="l01409"></a>01409 <span class="comment"> * forever to run, it's because we call this function</span>
<a name="l01410"></a>01410 <span class="comment"> * in inner loops thus making things quadratic.</span>
<a name="l01411"></a>01411 <span class="comment"> */</span>
<a name="l01412"></a>01412 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l01413"></a>01413 count_entries (<a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table)
<a name="l01414"></a>01414 {
<a name="l01415"></a>01415 <a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> iter;
<a name="l01416"></a>01416 <span class="keywordtype">int</span> count;
<a name="l01417"></a>01417
<a name="l01418"></a>01418 count = 0;
<a name="l01419"></a>01419 <a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c" title="Initializes a hash table iterator.">_dbus_hash_iter_init</a> (table, &iter);
<a name="l01420"></a>01420 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l01421"></a>01421 ++count;
<a name="l01422"></a>01422
<a name="l01423"></a>01423 _dbus_assert (count == <a class="code" href="group__DBusHashTable.html#gad48297fc27442c19a7c4bd4d1ef9ef77" title="Gets the number of hash entries in a hash table.">_dbus_hash_table_get_n_entries</a> (table));
<a name="l01424"></a>01424
<a name="l01425"></a>01425 <span class="keywordflow">return</span> count;
<a name="l01426"></a>01426 }
<a name="l01427"></a>01427
<a name="l01433"></a>01433 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a>
<a name="l01434"></a>01434 _dbus_hash_test (<span class="keywordtype">void</span>)
<a name="l01435"></a>01435 {
<a name="l01436"></a>01436 <span class="keywordtype">int</span> i;
<a name="l01437"></a>01437 <a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table1;
<a name="l01438"></a>01438 <a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table2;
<a name="l01439"></a>01439 <a class="code" href="structDBusHashTable.html" title="Internals of DBusHashTable.">DBusHashTable</a> *table3;
<a name="l01440"></a>01440 <a class="code" href="structDBusHashIter.html" title="Hash iterator object.">DBusHashIter</a> iter;
<a name="l01441"></a>01441 <span class="preprocessor">#define N_HASH_KEYS 5000</span>
<a name="l01442"></a>01442 <span class="preprocessor"></span> <span class="keywordtype">char</span> **keys;
<a name="l01443"></a>01443 <a class="code" href="group__DBusTypes.html#ga39c9cb0f3a2a8ad6f55cc4855d035349" title="A boolean, valid values are TRUE and FALSE.">dbus_bool_t</a> ret = <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>;
<a name="l01444"></a>01444
<a name="l01445"></a>01445 keys = <a class="code" href="group__DBusMemory.html#ga54ccb556e7964112a825a7f46c156ca0" title="Safe macro for using dbus_malloc().">dbus_new</a> (<span class="keywordtype">char</span> *, N_HASH_KEYS);
<a name="l01446"></a>01446 <span class="keywordflow">if</span> (keys == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01447"></a>01447 _dbus_assert_not_reached (<span class="stringliteral">"no memory"</span>);
<a name="l01448"></a>01448
<a name="l01449"></a>01449 <span class="keywordflow">for</span> (i = 0; i < N_HASH_KEYS; i++)
<a name="l01450"></a>01450 {
<a name="l01451"></a>01451 keys[i] = <a class="code" href="group__DBusMemory.html#gaf6e588659067a854c3cca7ebe8ae5084" title="Allocates the given number of bytes, as with standard malloc().">dbus_malloc</a> (128);
<a name="l01452"></a>01452
<a name="l01453"></a>01453 <span class="keywordflow">if</span> (keys[i] == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01454"></a>01454 _dbus_assert_not_reached (<span class="stringliteral">"no memory"</span>);
<a name="l01455"></a>01455 }
<a name="l01456"></a>01456
<a name="l01457"></a>01457 printf (<span class="stringliteral">"Computing test hash keys...\n"</span>);
<a name="l01458"></a>01458 i = 0;
<a name="l01459"></a>01459 <span class="keywordflow">while</span> (i < N_HASH_KEYS)
<a name="l01460"></a>01460 {
<a name="l01461"></a>01461 <span class="keywordtype">int</span> len;
<a name="l01462"></a>01462
<a name="l01463"></a>01463 len = sprintf (keys[i], <span class="stringliteral">"Hash key %d"</span>, i);
<a name="l01464"></a>01464 _dbus_assert (*(keys[i] + len) == <span class="charliteral">'\0'</span>);
<a name="l01465"></a>01465 ++i;
<a name="l01466"></a>01466 }
<a name="l01467"></a>01467 printf (<span class="stringliteral">"... done.\n"</span>);
<a name="l01468"></a>01468
<a name="l01469"></a>01469 table1 = <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>,
<a name="l01470"></a>01470 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>, <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>);
<a name="l01471"></a>01471 <span class="keywordflow">if</span> (table1 == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01472"></a>01472 <span class="keywordflow">goto</span> out;
<a name="l01473"></a>01473
<a name="l01474"></a>01474 table2 = <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>,
<a name="l01475"></a>01475 <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>);
<a name="l01476"></a>01476 <span class="keywordflow">if</span> (table2 == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01477"></a>01477 <span class="keywordflow">goto</span> out;
<a name="l01478"></a>01478
<a name="l01479"></a>01479 table3 = <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a477caf35cc3676d6412c9b57f1d0f6c7" title="Hash keys are integer capable to hold a pointer.">DBUS_HASH_UINTPTR</a>,
<a name="l01480"></a>01480 <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>);
<a name="l01481"></a>01481 <span class="keywordflow">if</span> (table3 == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01482"></a>01482 <span class="keywordflow">goto</span> out;
<a name="l01483"></a>01483
<a name="l01484"></a>01484 <span class="comment">/* Insert and remove a bunch of stuff, counting the table in between</span>
<a name="l01485"></a>01485 <span class="comment"> * to be sure it's not broken and that iteration works</span>
<a name="l01486"></a>01486 <span class="comment"> */</span>
<a name="l01487"></a>01487 i = 0;
<a name="l01488"></a>01488 <span class="keywordflow">while</span> (i < 3000)
<a name="l01489"></a>01489 {
<a name="l01490"></a>01490 <span class="keywordtype">void</span> *value;
<a name="l01491"></a>01491 <span class="keywordtype">char</span> *key;
<a name="l01492"></a>01492
<a name="l01493"></a>01493 key = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01494"></a>01494 <span class="keywordflow">if</span> (key == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01495"></a>01495 <span class="keywordflow">goto</span> out;
<a name="l01496"></a>01496 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (<span class="stringliteral">"Value!"</span>);
<a name="l01497"></a>01497 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01498"></a>01498 <span class="keywordflow">goto</span> out;
<a name="l01499"></a>01499
<a name="l01500"></a>01500 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#ga43e98a91a11952824c544330e19f6c22" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_string</a> (table1,
<a name="l01501"></a>01501 key, value))
<a name="l01502"></a>01502 <span class="keywordflow">goto</span> out;
<a name="l01503"></a>01503
<a name="l01504"></a>01504 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01505"></a>01505 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01506"></a>01506 <span class="keywordflow">goto</span> out;
<a name="l01507"></a>01507
<a name="l01508"></a>01508 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gaca20a83f3214db08fa34df2c49c8edd5" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_int</a> (table2,
<a name="l01509"></a>01509 i, value))
<a name="l01510"></a>01510 <span class="keywordflow">goto</span> out;
<a name="l01511"></a>01511
<a name="l01512"></a>01512 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01513"></a>01513 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01514"></a>01514 <span class="keywordflow">goto</span> out;
<a name="l01515"></a>01515
<a name="l01516"></a>01516 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#ga811d833032ca919a9063ca835482d01a" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_uintptr</a> (table3,
<a name="l01517"></a>01517 i, value))
<a name="l01518"></a>01518 <span class="keywordflow">goto</span> out;
<a name="l01519"></a>01519
<a name="l01520"></a>01520 _dbus_assert (count_entries (table1) == i + 1);
<a name="l01521"></a>01521 _dbus_assert (count_entries (table2) == i + 1);
<a name="l01522"></a>01522 _dbus_assert (count_entries (table3) == i + 1);
<a name="l01523"></a>01523
<a name="l01524"></a>01524 value = <a class="code" href="group__DBusHashTable.html#gad51eb3fe682721dd4f6a920ca87cb730" title="Looks up the value for a given string in a hash table of type DBUS_HASH_STRING.">_dbus_hash_table_lookup_string</a> (table1, keys[i]);
<a name="l01525"></a>01525 _dbus_assert (value != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01526"></a>01526 _dbus_assert (strcmp (value, <span class="stringliteral">"Value!"</span>) == 0);
<a name="l01527"></a>01527
<a name="l01528"></a>01528 value = <a class="code" href="group__DBusHashTable.html#ga36ff49c4c35599e6fcdadc7f6805c49e" title="Looks up the value for a given integer in a hash table of type DBUS_HASH_INT.">_dbus_hash_table_lookup_int</a> (table2, i);
<a name="l01529"></a>01529 _dbus_assert (value != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01530"></a>01530 _dbus_assert (strcmp (value, keys[i]) == 0);
<a name="l01531"></a>01531
<a name="l01532"></a>01532 value = <a class="code" href="group__DBusHashTable.html#gae0ac411f87a797767f36c6e64fd807b3" title="Looks up the value for a given integer in a hash table of type DBUS_HASH_UINTPTR.">_dbus_hash_table_lookup_uintptr</a> (table3, i);
<a name="l01533"></a>01533 _dbus_assert (value != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01534"></a>01534 _dbus_assert (strcmp (value, keys[i]) == 0);
<a name="l01535"></a>01535
<a name="l01536"></a>01536 ++i;
<a name="l01537"></a>01537 }
<a name="l01538"></a>01538
<a name="l01539"></a>01539 --i;
<a name="l01540"></a>01540 <span class="keywordflow">while</span> (i >= 0)
<a name="l01541"></a>01541 {
<a name="l01542"></a>01542 <a class="code" href="group__DBusHashTable.html#ga388d50ce1a07bf0790b9f2ecdb08a396" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_string</a> (table1,
<a name="l01543"></a>01543 keys[i]);
<a name="l01544"></a>01544
<a name="l01545"></a>01545 <a class="code" href="group__DBusHashTable.html#gacdebe75bd692605a69dc73c15e0eefd0" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_int</a> (table2, i);
<a name="l01546"></a>01546
<a name="l01547"></a>01547 <a class="code" href="group__DBusHashTable.html#ga0ad8fa1108bad2b4bd5b4ce539d32d64" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_uintptr</a> (table3, i);
<a name="l01548"></a>01548
<a name="l01549"></a>01549 _dbus_assert (count_entries (table1) == i);
<a name="l01550"></a>01550 _dbus_assert (count_entries (table2) == i);
<a name="l01551"></a>01551 _dbus_assert (count_entries (table3) == i);
<a name="l01552"></a>01552
<a name="l01553"></a>01553 --i;
<a name="l01554"></a>01554 }
<a name="l01555"></a>01555
<a name="l01556"></a>01556 <a class="code" href="group__DBusHashTable.html#ga4ad4622378885e5d911c26956e174a45" title="Increments the reference count for a hash table.">_dbus_hash_table_ref</a> (table1);
<a name="l01557"></a>01557 <a class="code" href="group__DBusHashTable.html#ga4ad4622378885e5d911c26956e174a45" title="Increments the reference count for a hash table.">_dbus_hash_table_ref</a> (table2);
<a name="l01558"></a>01558 <a class="code" href="group__DBusHashTable.html#ga4ad4622378885e5d911c26956e174a45" title="Increments the reference count for a hash table.">_dbus_hash_table_ref</a> (table3);
<a name="l01559"></a>01559 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table1);
<a name="l01560"></a>01560 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table2);
<a name="l01561"></a>01561 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table3);
<a name="l01562"></a>01562 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table1);
<a name="l01563"></a>01563 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table2);
<a name="l01564"></a>01564 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table3);
<a name="l01565"></a>01565 table3 = <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>;
<a name="l01566"></a>01566
<a name="l01567"></a>01567 <span class="comment">/* Insert a bunch of stuff then check</span>
<a name="l01568"></a>01568 <span class="comment"> * that iteration works correctly (finds the right</span>
<a name="l01569"></a>01569 <span class="comment"> * values, iter_set_value works, etc.)</span>
<a name="l01570"></a>01570 <span class="comment"> */</span>
<a name="l01571"></a>01571 table1 = <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>,
<a name="l01572"></a>01572 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>, <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>);
<a name="l01573"></a>01573 <span class="keywordflow">if</span> (table1 == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01574"></a>01574 <span class="keywordflow">goto</span> out;
<a name="l01575"></a>01575
<a name="l01576"></a>01576 table2 = <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>,
<a name="l01577"></a>01577 <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>);
<a name="l01578"></a>01578 <span class="keywordflow">if</span> (table2 == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01579"></a>01579 <span class="keywordflow">goto</span> out;
<a name="l01580"></a>01580
<a name="l01581"></a>01581 i = 0;
<a name="l01582"></a>01582 <span class="keywordflow">while</span> (i < 5000)
<a name="l01583"></a>01583 {
<a name="l01584"></a>01584 <span class="keywordtype">char</span> *key;
<a name="l01585"></a>01585 <span class="keywordtype">void</span> *value;
<a name="l01586"></a>01586
<a name="l01587"></a>01587 key = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01588"></a>01588 <span class="keywordflow">if</span> (key == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01589"></a>01589 <span class="keywordflow">goto</span> out;
<a name="l01590"></a>01590 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (<span class="stringliteral">"Value!"</span>);
<a name="l01591"></a>01591 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01592"></a>01592 <span class="keywordflow">goto</span> out;
<a name="l01593"></a>01593
<a name="l01594"></a>01594 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#ga43e98a91a11952824c544330e19f6c22" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_string</a> (table1,
<a name="l01595"></a>01595 key, value))
<a name="l01596"></a>01596 <span class="keywordflow">goto</span> out;
<a name="l01597"></a>01597
<a name="l01598"></a>01598 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01599"></a>01599 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01600"></a>01600 <span class="keywordflow">goto</span> out;
<a name="l01601"></a>01601
<a name="l01602"></a>01602 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gaca20a83f3214db08fa34df2c49c8edd5" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_int</a> (table2,
<a name="l01603"></a>01603 i, value))
<a name="l01604"></a>01604 <span class="keywordflow">goto</span> out;
<a name="l01605"></a>01605
<a name="l01606"></a>01606 _dbus_assert (count_entries (table1) == i + 1);
<a name="l01607"></a>01607 _dbus_assert (count_entries (table2) == i + 1);
<a name="l01608"></a>01608
<a name="l01609"></a>01609 ++i;
<a name="l01610"></a>01610 }
<a name="l01611"></a>01611
<a name="l01612"></a>01612 <a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c" title="Initializes a hash table iterator.">_dbus_hash_iter_init</a> (table1, &iter);
<a name="l01613"></a>01613 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l01614"></a>01614 {
<a name="l01615"></a>01615 <span class="keyword">const</span> <span class="keywordtype">char</span> *key;
<a name="l01616"></a>01616 <span class="keywordtype">void</span> *value;
<a name="l01617"></a>01617
<a name="l01618"></a>01618 key = <a class="code" href="group__DBusHashTable.html#gaa0cff082174b1ab0380902ce4ae43d08" title="Gets the key for the current entry.">_dbus_hash_iter_get_string_key</a> (&iter);
<a name="l01619"></a>01619 value = <a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5" title="Gets the value of the current entry.">_dbus_hash_iter_get_value</a> (&iter);
<a name="l01620"></a>01620
<a name="l01621"></a>01621 _dbus_assert (<a class="code" href="group__DBusHashTable.html#gad51eb3fe682721dd4f6a920ca87cb730" title="Looks up the value for a given string in a hash table of type DBUS_HASH_STRING.">_dbus_hash_table_lookup_string</a> (table1, key) == value);
<a name="l01622"></a>01622
<a name="l01623"></a>01623 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (<span class="stringliteral">"Different value!"</span>);
<a name="l01624"></a>01624 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01625"></a>01625 <span class="keywordflow">goto</span> out;
<a name="l01626"></a>01626
<a name="l01627"></a>01627 <a class="code" href="group__DBusHashTable.html#ga24193343c0948019d4a302fc18bfd5d9" title="Sets the value of the current entry.">_dbus_hash_iter_set_value</a> (&iter, value);
<a name="l01628"></a>01628
<a name="l01629"></a>01629 _dbus_assert (<a class="code" href="group__DBusHashTable.html#gad51eb3fe682721dd4f6a920ca87cb730" title="Looks up the value for a given string in a hash table of type DBUS_HASH_STRING.">_dbus_hash_table_lookup_string</a> (table1, key) == value);
<a name="l01630"></a>01630 }
<a name="l01631"></a>01631
<a name="l01632"></a>01632 <a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c" title="Initializes a hash table iterator.">_dbus_hash_iter_init</a> (table1, &iter);
<a name="l01633"></a>01633 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l01634"></a>01634 {
<a name="l01635"></a>01635 <a class="code" href="group__DBusHashTable.html#ga0ef12d773a546f070cff91cbf1e8d16e" title="Removes the current entry from the hash table.">_dbus_hash_iter_remove_entry</a> (&iter);
<a name="l01636"></a>01636 _dbus_assert (count_entries (table1) == i - 1);
<a name="l01637"></a>01637 --i;
<a name="l01638"></a>01638 }
<a name="l01639"></a>01639
<a name="l01640"></a>01640 <a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c" title="Initializes a hash table iterator.">_dbus_hash_iter_init</a> (table2, &iter);
<a name="l01641"></a>01641 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l01642"></a>01642 {
<a name="l01643"></a>01643 <span class="keywordtype">int</span> key;
<a name="l01644"></a>01644 <span class="keywordtype">void</span> *value;
<a name="l01645"></a>01645
<a name="l01646"></a>01646 key = <a class="code" href="group__DBusHashTable.html#ga7a1b9fd35f9f7bdd86f9d71a6379053f" title="Gets the key for the current entry.">_dbus_hash_iter_get_int_key</a> (&iter);
<a name="l01647"></a>01647 value = <a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5" title="Gets the value of the current entry.">_dbus_hash_iter_get_value</a> (&iter);
<a name="l01648"></a>01648
<a name="l01649"></a>01649 _dbus_assert (<a class="code" href="group__DBusHashTable.html#ga36ff49c4c35599e6fcdadc7f6805c49e" title="Looks up the value for a given integer in a hash table of type DBUS_HASH_INT.">_dbus_hash_table_lookup_int</a> (table2, key) == value);
<a name="l01650"></a>01650
<a name="l01651"></a>01651 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (<span class="stringliteral">"Different value!"</span>);
<a name="l01652"></a>01652 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01653"></a>01653 <span class="keywordflow">goto</span> out;
<a name="l01654"></a>01654
<a name="l01655"></a>01655 <a class="code" href="group__DBusHashTable.html#ga24193343c0948019d4a302fc18bfd5d9" title="Sets the value of the current entry.">_dbus_hash_iter_set_value</a> (&iter, value);
<a name="l01656"></a>01656
<a name="l01657"></a>01657 _dbus_assert (<a class="code" href="group__DBusHashTable.html#ga36ff49c4c35599e6fcdadc7f6805c49e" title="Looks up the value for a given integer in a hash table of type DBUS_HASH_INT.">_dbus_hash_table_lookup_int</a> (table2, key) == value);
<a name="l01658"></a>01658 }
<a name="l01659"></a>01659
<a name="l01660"></a>01660 i = count_entries (table2);
<a name="l01661"></a>01661 <a class="code" href="group__DBusHashTable.html#ga1b0e6df8a8617ef0f8f25adfba3acc4c" title="Initializes a hash table iterator.">_dbus_hash_iter_init</a> (table2, &iter);
<a name="l01662"></a>01662 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l01663"></a>01663 {
<a name="l01664"></a>01664 <a class="code" href="group__DBusHashTable.html#ga0ef12d773a546f070cff91cbf1e8d16e" title="Removes the current entry from the hash table.">_dbus_hash_iter_remove_entry</a> (&iter);
<a name="l01665"></a>01665 _dbus_assert (count_entries (table2) + 1 == i);
<a name="l01666"></a>01666 --i;
<a name="l01667"></a>01667 }
<a name="l01668"></a>01668
<a name="l01669"></a>01669 <span class="comment">/* add/remove interleaved, to check that we grow/shrink the table</span>
<a name="l01670"></a>01670 <span class="comment"> * appropriately</span>
<a name="l01671"></a>01671 <span class="comment"> */</span>
<a name="l01672"></a>01672 i = 0;
<a name="l01673"></a>01673 <span class="keywordflow">while</span> (i < 1000)
<a name="l01674"></a>01674 {
<a name="l01675"></a>01675 <span class="keywordtype">char</span> *key;
<a name="l01676"></a>01676 <span class="keywordtype">void</span> *value;
<a name="l01677"></a>01677
<a name="l01678"></a>01678 key = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01679"></a>01679 <span class="keywordflow">if</span> (key == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01680"></a>01680 <span class="keywordflow">goto</span> out;
<a name="l01681"></a>01681
<a name="l01682"></a>01682 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (<span class="stringliteral">"Value!"</span>);
<a name="l01683"></a>01683 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01684"></a>01684 <span class="keywordflow">goto</span> out;
<a name="l01685"></a>01685
<a name="l01686"></a>01686 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#ga43e98a91a11952824c544330e19f6c22" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_string</a> (table1,
<a name="l01687"></a>01687 key, value))
<a name="l01688"></a>01688 <span class="keywordflow">goto</span> out;
<a name="l01689"></a>01689
<a name="l01690"></a>01690 ++i;
<a name="l01691"></a>01691 }
<a name="l01692"></a>01692
<a name="l01693"></a>01693 --i;
<a name="l01694"></a>01694 <span class="keywordflow">while</span> (i >= 0)
<a name="l01695"></a>01695 {
<a name="l01696"></a>01696 <span class="keywordtype">char</span> *key;
<a name="l01697"></a>01697 <span class="keywordtype">void</span> *value;
<a name="l01698"></a>01698
<a name="l01699"></a>01699 key = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01700"></a>01700 <span class="keywordflow">if</span> (key == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01701"></a>01701 <span class="keywordflow">goto</span> out;
<a name="l01702"></a>01702 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (<span class="stringliteral">"Value!"</span>);
<a name="l01703"></a>01703 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01704"></a>01704 <span class="keywordflow">goto</span> out;
<a name="l01705"></a>01705
<a name="l01706"></a>01706 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#ga388d50ce1a07bf0790b9f2ecdb08a396" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_string</a> (table1, keys[i]))
<a name="l01707"></a>01707 <span class="keywordflow">goto</span> out;
<a name="l01708"></a>01708
<a name="l01709"></a>01709 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#ga43e98a91a11952824c544330e19f6c22" title="Creates a hash entry with the given key and value.">_dbus_hash_table_insert_string</a> (table1,
<a name="l01710"></a>01710 key, value))
<a name="l01711"></a>01711 <span class="keywordflow">goto</span> out;
<a name="l01712"></a>01712
<a name="l01713"></a>01713 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#ga388d50ce1a07bf0790b9f2ecdb08a396" title="Removes the hash entry for the given key.">_dbus_hash_table_remove_string</a> (table1, keys[i]))
<a name="l01714"></a>01714 <span class="keywordflow">goto</span> out;
<a name="l01715"></a>01715
<a name="l01716"></a>01716 _dbus_assert (<a class="code" href="group__DBusHashTable.html#gad48297fc27442c19a7c4bd4d1ef9ef77" title="Gets the number of hash entries in a hash table.">_dbus_hash_table_get_n_entries</a> (table1) == i);
<a name="l01717"></a>01717
<a name="l01718"></a>01718 --i;
<a name="l01719"></a>01719 }
<a name="l01720"></a>01720
<a name="l01721"></a>01721 <span class="comment">/* nuke these tables */</span>
<a name="l01722"></a>01722 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table1);
<a name="l01723"></a>01723 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table2);
<a name="l01724"></a>01724
<a name="l01725"></a>01725
<a name="l01726"></a>01726 <span class="comment">/* Now do a bunch of things again using _dbus_hash_iter_lookup() to</span>
<a name="l01727"></a>01727 <span class="comment"> * be sure that interface works.</span>
<a name="l01728"></a>01728 <span class="comment"> */</span>
<a name="l01729"></a>01729 table1 = <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a481fd0166d28da725b3e97f15192434e" title="Hash keys are strings.">DBUS_HASH_STRING</a>,
<a name="l01730"></a>01730 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>, <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>);
<a name="l01731"></a>01731 <span class="keywordflow">if</span> (table1 == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01732"></a>01732 <span class="keywordflow">goto</span> out;
<a name="l01733"></a>01733
<a name="l01734"></a>01734 table2 = <a class="code" href="group__DBusHashTable.html#gac8e434348a354b9606d4c50c127a5eb4" title="Constructs a new hash table.">_dbus_hash_table_new</a> (<a class="code" href="group__DBusHashTable.html#ggab0ab9767ffa5b6720a13b3d741630852a26446bd9fbb15c6c381b35a810207141" title="Hash keys are integers.">DBUS_HASH_INT</a>,
<a name="l01735"></a>01735 <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>, <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a>);
<a name="l01736"></a>01736 <span class="keywordflow">if</span> (table2 == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01737"></a>01737 <span class="keywordflow">goto</span> out;
<a name="l01738"></a>01738
<a name="l01739"></a>01739 i = 0;
<a name="l01740"></a>01740 <span class="keywordflow">while</span> (i < 3000)
<a name="l01741"></a>01741 {
<a name="l01742"></a>01742 <span class="keywordtype">void</span> *value;
<a name="l01743"></a>01743 <span class="keywordtype">char</span> *key;
<a name="l01744"></a>01744
<a name="l01745"></a>01745 key = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01746"></a>01746 <span class="keywordflow">if</span> (key == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01747"></a>01747 <span class="keywordflow">goto</span> out;
<a name="l01748"></a>01748 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (<span class="stringliteral">"Value!"</span>);
<a name="l01749"></a>01749 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01750"></a>01750 <span class="keywordflow">goto</span> out;
<a name="l01751"></a>01751
<a name="l01752"></a>01752 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb" title="A low-level but efficient interface for manipulating the hash table.">_dbus_hash_iter_lookup</a> (table1,
<a name="l01753"></a>01753 key, <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>, &iter))
<a name="l01754"></a>01754 <span class="keywordflow">goto</span> out;
<a name="l01755"></a>01755 _dbus_assert (<a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5" title="Gets the value of the current entry.">_dbus_hash_iter_get_value</a> (&iter) == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01756"></a>01756 <a class="code" href="group__DBusHashTable.html#ga24193343c0948019d4a302fc18bfd5d9" title="Sets the value of the current entry.">_dbus_hash_iter_set_value</a> (&iter, value);
<a name="l01757"></a>01757
<a name="l01758"></a>01758 value = <a class="code" href="group__DBusInternalsUtils.html#ga9d00d77f6595b9d7ac1baf59d44bf58c" title="Duplicates a string.">_dbus_strdup</a> (keys[i]);
<a name="l01759"></a>01759 <span class="keywordflow">if</span> (value == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>)
<a name="l01760"></a>01760 <span class="keywordflow">goto</span> out;
<a name="l01761"></a>01761
<a name="l01762"></a>01762 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb" title="A low-level but efficient interface for manipulating the hash table.">_dbus_hash_iter_lookup</a> (table2,
<a name="l01763"></a>01763 _DBUS_INT_TO_POINTER (i), <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>, &iter))
<a name="l01764"></a>01764 <span class="keywordflow">goto</span> out;
<a name="l01765"></a>01765 _dbus_assert (<a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5" title="Gets the value of the current entry.">_dbus_hash_iter_get_value</a> (&iter) == <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01766"></a>01766 <a class="code" href="group__DBusHashTable.html#ga24193343c0948019d4a302fc18bfd5d9" title="Sets the value of the current entry.">_dbus_hash_iter_set_value</a> (&iter, value);
<a name="l01767"></a>01767
<a name="l01768"></a>01768 _dbus_assert (count_entries (table1) == i + 1);
<a name="l01769"></a>01769 _dbus_assert (count_entries (table2) == i + 1);
<a name="l01770"></a>01770
<a name="l01771"></a>01771 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb" title="A low-level but efficient interface for manipulating the hash table.">_dbus_hash_iter_lookup</a> (table1, keys[i], <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, &iter))
<a name="l01772"></a>01772 <span class="keywordflow">goto</span> out;
<a name="l01773"></a>01773
<a name="l01774"></a>01774 value = <a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5" title="Gets the value of the current entry.">_dbus_hash_iter_get_value</a> (&iter);
<a name="l01775"></a>01775 _dbus_assert (value != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01776"></a>01776 _dbus_assert (strcmp (value, <span class="stringliteral">"Value!"</span>) == 0);
<a name="l01777"></a>01777
<a name="l01778"></a>01778 <span class="comment">/* Iterate just to be sure it works, though</span>
<a name="l01779"></a>01779 <span class="comment"> * it's a stupid thing to do</span>
<a name="l01780"></a>01780 <span class="comment"> */</span>
<a name="l01781"></a>01781 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l01782"></a>01782 ;
<a name="l01783"></a>01783
<a name="l01784"></a>01784 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb" title="A low-level but efficient interface for manipulating the hash table.">_dbus_hash_iter_lookup</a> (table2, _DBUS_INT_TO_POINTER (i), <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, &iter))
<a name="l01785"></a>01785 <span class="keywordflow">goto</span> out;
<a name="l01786"></a>01786
<a name="l01787"></a>01787 value = <a class="code" href="group__DBusHashTable.html#ga34bf277ee37f919bd00516b5ae4e12b5" title="Gets the value of the current entry.">_dbus_hash_iter_get_value</a> (&iter);
<a name="l01788"></a>01788 _dbus_assert (value != <a class="code" href="group__DBusMacros.html#ga070d2ce7b6bb7e5c05602aa8c308d0c4" title="A null pointer, defined appropriately for C or C++.">NULL</a>);
<a name="l01789"></a>01789 _dbus_assert (strcmp (value, keys[i]) == 0);
<a name="l01790"></a>01790
<a name="l01791"></a>01791 <span class="comment">/* Iterate just to be sure it works, though</span>
<a name="l01792"></a>01792 <span class="comment"> * it's a stupid thing to do</span>
<a name="l01793"></a>01793 <span class="comment"> */</span>
<a name="l01794"></a>01794 <span class="keywordflow">while</span> (<a class="code" href="group__DBusHashTable.html#ga723e61fcc91ca673e90ff872c07ea19c" title="Move the hash iterator forward one step, to the next hash entry.">_dbus_hash_iter_next</a> (&iter))
<a name="l01795"></a>01795 ;
<a name="l01796"></a>01796
<a name="l01797"></a>01797 ++i;
<a name="l01798"></a>01798 }
<a name="l01799"></a>01799
<a name="l01800"></a>01800 --i;
<a name="l01801"></a>01801 <span class="keywordflow">while</span> (i >= 0)
<a name="l01802"></a>01802 {
<a name="l01803"></a>01803 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb" title="A low-level but efficient interface for manipulating the hash table.">_dbus_hash_iter_lookup</a> (table1, keys[i], <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, &iter))
<a name="l01804"></a>01804 _dbus_assert_not_reached (<span class="stringliteral">"hash entry should have existed"</span>);
<a name="l01805"></a>01805 <a class="code" href="group__DBusHashTable.html#ga0ef12d773a546f070cff91cbf1e8d16e" title="Removes the current entry from the hash table.">_dbus_hash_iter_remove_entry</a> (&iter);
<a name="l01806"></a>01806
<a name="l01807"></a>01807 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusHashTable.html#gab156c35d6dd9ff6e408a835db28323fb" title="A low-level but efficient interface for manipulating the hash table.">_dbus_hash_iter_lookup</a> (table2, _DBUS_INT_TO_POINTER (i), <a class="code" href="group__DBusMacros.html#gaa93f0eb578d23995850d61f7d61c55c1" title="Expands to "0".">FALSE</a>, &iter))
<a name="l01808"></a>01808 _dbus_assert_not_reached (<span class="stringliteral">"hash entry should have existed"</span>);
<a name="l01809"></a>01809 <a class="code" href="group__DBusHashTable.html#ga0ef12d773a546f070cff91cbf1e8d16e" title="Removes the current entry from the hash table.">_dbus_hash_iter_remove_entry</a> (&iter);
<a name="l01810"></a>01810
<a name="l01811"></a>01811 _dbus_assert (count_entries (table1) == i);
<a name="l01812"></a>01812 _dbus_assert (count_entries (table2) == i);
<a name="l01813"></a>01813
<a name="l01814"></a>01814 --i;
<a name="l01815"></a>01815 }
<a name="l01816"></a>01816
<a name="l01817"></a>01817 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table1);
<a name="l01818"></a>01818 <a class="code" href="group__DBusHashTable.html#ga96b777e00764b44e0f3216fd8478f5a9" title="Decrements the reference count for a hash table, freeing the hash table if the count reaches zero...">_dbus_hash_table_unref</a> (table2);
<a name="l01819"></a>01819
<a name="l01820"></a>01820 ret = <a class="code" href="group__DBusMacros.html#gaa8cecfc5c5c054d2875c03e77b7be15d" title="Expands to "1".">TRUE</a>;
<a name="l01821"></a>01821
<a name="l01822"></a>01822 out:
<a name="l01823"></a>01823 <span class="keywordflow">for</span> (i = 0; i < N_HASH_KEYS; i++)
<a name="l01824"></a>01824 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a> (keys[i]);
<a name="l01825"></a>01825
<a name="l01826"></a>01826 <a class="code" href="group__DBusMemory.html#ga34e666b19b015035a9a31e53da84b39a" title="Frees a block of memory previously allocated by dbus_malloc() or dbus_malloc0().">dbus_free</a> (keys);
<a name="l01827"></a>01827
<a name="l01828"></a>01828 <span class="keywordflow">return</span> ret;
<a name="l01829"></a>01829 }
<a name="l01830"></a>01830
<a name="l01831"></a>01831 <span class="preprocessor">#endif </span><span class="comment">/* DBUS_ENABLE_EMBEDDED_TESTS */</span>
</pre></div></div><!-- contents -->
<hr class="footer"/><address class="footer"><small>
Generated on Thu Mar 3 2016 17:50:30 for D-Bus by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>
</body>
</html>