529 lines
48 KiB
HTML
529 lines
48 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - cov-sh.info - bash-4.4.23/hashlib.c</title>
|
|
<link rel="stylesheet" type="text/css" href="../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">bash-4.4.23</a> - hashlib.c<span style="font-size: 80%;"> (source / <a href="hashlib.c.func-sort-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="15%"></td>
|
|
<td width="10%" class="headerCovTableHead">Hit</td>
|
|
<td width="10%" class="headerCovTableHead">Total</td>
|
|
<td width="15%" class="headerCovTableHead">Coverage</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">cov-sh.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntry">73</td>
|
|
<td class="headerCovTableEntry">129</td>
|
|
<td class="headerCovTableEntryLo">56.6 %</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Date:</td>
|
|
<td class="headerValue">2020-10-29 14:49:55</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntry">6</td>
|
|
<td class="headerCovTableEntry">12</td>
|
|
<td class="headerCovTableEntryLo">50.0 %</td>
|
|
</tr>
|
|
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<a name="1"><span class="lineNum"> 1 </span> : /* hashlib.c -- functions to manage and access hash tables for bash. */</a>
|
|
<a name="2"><span class="lineNum"> 2 </span> : </a>
|
|
<a name="3"><span class="lineNum"> 3 </span> : /* Copyright (C) 1987,1989,1991,1995,1998,2001,2003,2005,2006,2008,2009 Free Software Foundation, Inc.</a>
|
|
<a name="4"><span class="lineNum"> 4 </span> : </a>
|
|
<a name="5"><span class="lineNum"> 5 </span> : This file is part of GNU Bash, the Bourne Again SHell.</a>
|
|
<a name="6"><span class="lineNum"> 6 </span> : </a>
|
|
<a name="7"><span class="lineNum"> 7 </span> : Bash is free software: you can redistribute it and/or modify</a>
|
|
<a name="8"><span class="lineNum"> 8 </span> : it under the terms of the GNU General Public License as published by</a>
|
|
<a name="9"><span class="lineNum"> 9 </span> : the Free Software Foundation, either version 3 of the License, or</a>
|
|
<a name="10"><span class="lineNum"> 10 </span> : (at your option) any later version.</a>
|
|
<a name="11"><span class="lineNum"> 11 </span> : </a>
|
|
<a name="12"><span class="lineNum"> 12 </span> : Bash is distributed in the hope that it will be useful,</a>
|
|
<a name="13"><span class="lineNum"> 13 </span> : but WITHOUT ANY WARRANTY; without even the implied warranty of</a>
|
|
<a name="14"><span class="lineNum"> 14 </span> : MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</a>
|
|
<a name="15"><span class="lineNum"> 15 </span> : GNU General Public License for more details.</a>
|
|
<a name="16"><span class="lineNum"> 16 </span> : </a>
|
|
<a name="17"><span class="lineNum"> 17 </span> : You should have received a copy of the GNU General Public License</a>
|
|
<a name="18"><span class="lineNum"> 18 </span> : along with Bash. If not, see <http://www.gnu.org/licenses/>.</a>
|
|
<a name="19"><span class="lineNum"> 19 </span> : */</a>
|
|
<a name="20"><span class="lineNum"> 20 </span> : </a>
|
|
<a name="21"><span class="lineNum"> 21 </span> : #include <config.h></a>
|
|
<a name="22"><span class="lineNum"> 22 </span> : </a>
|
|
<a name="23"><span class="lineNum"> 23 </span> : #include "bashansi.h"</a>
|
|
<a name="24"><span class="lineNum"> 24 </span> : </a>
|
|
<a name="25"><span class="lineNum"> 25 </span> : #if defined (HAVE_UNISTD_H)</a>
|
|
<a name="26"><span class="lineNum"> 26 </span> : # ifdef _MINIX</a>
|
|
<a name="27"><span class="lineNum"> 27 </span> : # include <sys/types.h></a>
|
|
<a name="28"><span class="lineNum"> 28 </span> : # endif</a>
|
|
<a name="29"><span class="lineNum"> 29 </span> : # include <unistd.h></a>
|
|
<a name="30"><span class="lineNum"> 30 </span> : #endif</a>
|
|
<a name="31"><span class="lineNum"> 31 </span> : </a>
|
|
<a name="32"><span class="lineNum"> 32 </span> : #include <stdio.h></a>
|
|
<a name="33"><span class="lineNum"> 33 </span> : </a>
|
|
<a name="34"><span class="lineNum"> 34 </span> : #include "shell.h"</a>
|
|
<a name="35"><span class="lineNum"> 35 </span> : #include "hashlib.h"</a>
|
|
<a name="36"><span class="lineNum"> 36 </span> : </a>
|
|
<a name="37"><span class="lineNum"> 37 </span> : /* Rely on properties of unsigned division (unsigned/int -> unsigned) and</a>
|
|
<a name="38"><span class="lineNum"> 38 </span> : don't discard the upper 32 bits of the value, if present. */</a>
|
|
<a name="39"><span class="lineNum"> 39 </span> : #define HASH_BUCKET(s, t, h) (((h) = hash_string (s)) & ((t)->nbuckets - 1))</a>
|
|
<a name="40"><span class="lineNum"> 40 </span> : </a>
|
|
<a name="41"><span class="lineNum"> 41 </span> : static BUCKET_CONTENTS *copy_bucket_array __P((BUCKET_CONTENTS *, sh_string_func_t *));</a>
|
|
<a name="42"><span class="lineNum"> 42 </span> : </a>
|
|
<a name="43"><span class="lineNum"> 43 </span> : /* Make a new hash table with BUCKETS number of buckets. Initialize</a>
|
|
<a name="44"><span class="lineNum"> 44 </span> : each slot in the table to NULL. */</a>
|
|
<a name="45"><span class="lineNum"> 45 </span> : HASH_TABLE *</a>
|
|
<a name="46"><span class="lineNum"> 46 </span><span class="lineCov"> 47766230 : hash_create (buckets)</span></a>
|
|
<a name="47"><span class="lineNum"> 47 </span> : int buckets;</a>
|
|
<a name="48"><span class="lineNum"> 48 </span> : {</a>
|
|
<a name="49"><span class="lineNum"> 49 </span><span class="lineCov"> 47766230 : HASH_TABLE *new_table;</span></a>
|
|
<a name="50"><span class="lineNum"> 50 </span><span class="lineCov"> 47766230 : register int i;</span></a>
|
|
<a name="51"><span class="lineNum"> 51 </span> : </a>
|
|
<a name="52"><span class="lineNum"> 52 </span><span class="lineCov"> 47766230 : new_table = (HASH_TABLE *)xmalloc (sizeof (HASH_TABLE));</span></a>
|
|
<a name="53"><span class="lineNum"> 53 </span><span class="lineCov"> 47766230 : if (buckets == 0)</span></a>
|
|
<a name="54"><span class="lineNum"> 54 </span><span class="lineCov"> 19085902 : buckets = DEFAULT_HASH_BUCKETS;</span></a>
|
|
<a name="55"><span class="lineNum"> 55 </span> : </a>
|
|
<a name="56"><span class="lineNum"> 56 </span><span class="lineCov"> 95532460 : new_table->bucket_array =</span></a>
|
|
<a name="57"><span class="lineNum"> 57 </span><span class="lineCov"> 47766230 : (BUCKET_CONTENTS **)xmalloc (buckets * sizeof (BUCKET_CONTENTS *));</span></a>
|
|
<a name="58"><span class="lineNum"> 58 </span><span class="lineCov"> 47766230 : new_table->nbuckets = buckets;</span></a>
|
|
<a name="59"><span class="lineNum"> 59 </span><span class="lineCov"> 47766230 : new_table->nentries = 0;</span></a>
|
|
<a name="60"><span class="lineNum"> 60 </span> : </a>
|
|
<a name="61"><span class="lineNum"> 61 </span><span class="lineCov">22037588394 : for (i = 0; i < buckets; i++)</span></a>
|
|
<a name="62"><span class="lineNum"> 62 </span><span class="lineCov">21989822164 : new_table->bucket_array[i] = (BUCKET_CONTENTS *)NULL;</span></a>
|
|
<a name="63"><span class="lineNum"> 63 </span> : </a>
|
|
<a name="64"><span class="lineNum"> 64 </span><span class="lineCov"> 47766230 : return (new_table);</span></a>
|
|
<a name="65"><span class="lineNum"> 65 </span> : }</a>
|
|
<a name="66"><span class="lineNum"> 66 </span> : </a>
|
|
<a name="67"><span class="lineNum"> 67 </span> : int</a>
|
|
<a name="68"><span class="lineNum"> 68 </span><span class="lineNoCov"> 0 : hash_size (table)</span></a>
|
|
<a name="69"><span class="lineNum"> 69 </span> : HASH_TABLE *table;</a>
|
|
<a name="70"><span class="lineNum"> 70 </span> : {</a>
|
|
<a name="71"><span class="lineNum"> 71 </span><span class="lineNoCov"> 0 : return (HASH_ENTRIES(table));</span></a>
|
|
<a name="72"><span class="lineNum"> 72 </span> : }</a>
|
|
<a name="73"><span class="lineNum"> 73 </span> : </a>
|
|
<a name="74"><span class="lineNum"> 74 </span> : static BUCKET_CONTENTS *</a>
|
|
<a name="75"><span class="lineNum"> 75 </span><span class="lineNoCov"> 0 : copy_bucket_array (ba, cpdata)</span></a>
|
|
<a name="76"><span class="lineNum"> 76 </span> : BUCKET_CONTENTS *ba;</a>
|
|
<a name="77"><span class="lineNum"> 77 </span> : sh_string_func_t *cpdata; /* data copy function */</a>
|
|
<a name="78"><span class="lineNum"> 78 </span> : {</a>
|
|
<a name="79"><span class="lineNum"> 79 </span><span class="lineNoCov"> 0 : BUCKET_CONTENTS *new_bucket, *n, *e;</span></a>
|
|
<a name="80"><span class="lineNum"> 80 </span> : </a>
|
|
<a name="81"><span class="lineNum"> 81 </span><span class="lineNoCov"> 0 : if (ba == 0)</span></a>
|
|
<a name="82"><span class="lineNum"> 82 </span> : return ((BUCKET_CONTENTS *)0);</a>
|
|
<a name="83"><span class="lineNum"> 83 </span> : </a>
|
|
<a name="84"><span class="lineNum"> 84 </span><span class="lineNoCov"> 0 : for (n = (BUCKET_CONTENTS *)0, e = ba; e; e = e->next)</span></a>
|
|
<a name="85"><span class="lineNum"> 85 </span> : {</a>
|
|
<a name="86"><span class="lineNum"> 86 </span><span class="lineNoCov"> 0 : if (n == 0)</span></a>
|
|
<a name="87"><span class="lineNum"> 87 </span> : {</a>
|
|
<a name="88"><span class="lineNum"> 88 </span><span class="lineNoCov"> 0 : new_bucket = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS));</span></a>
|
|
<a name="89"><span class="lineNum"> 89 </span><span class="lineNoCov"> 0 : n = new_bucket;</span></a>
|
|
<a name="90"><span class="lineNum"> 90 </span> : }</a>
|
|
<a name="91"><span class="lineNum"> 91 </span> : else</a>
|
|
<a name="92"><span class="lineNum"> 92 </span> : {</a>
|
|
<a name="93"><span class="lineNum"> 93 </span><span class="lineNoCov"> 0 : n->next = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS));</span></a>
|
|
<a name="94"><span class="lineNum"> 94 </span><span class="lineNoCov"> 0 : n = n->next;</span></a>
|
|
<a name="95"><span class="lineNum"> 95 </span> : }</a>
|
|
<a name="96"><span class="lineNum"> 96 </span> : </a>
|
|
<a name="97"><span class="lineNum"> 97 </span><span class="lineNoCov"> 0 : n->key = savestring (e->key);</span></a>
|
|
<a name="98"><span class="lineNum"> 98 </span><span class="lineNoCov"> 0 : n->data = e->data ? (cpdata ? (*cpdata) (e->data) : savestring (e->data))</span></a>
|
|
<a name="99"><span class="lineNum"> 99 </span><span class="lineNoCov"> 0 : : NULL;</span></a>
|
|
<a name="100"><span class="lineNum"> 100 </span><span class="lineNoCov"> 0 : n->khash = e->khash;</span></a>
|
|
<a name="101"><span class="lineNum"> 101 </span><span class="lineNoCov"> 0 : n->times_found = e->times_found;</span></a>
|
|
<a name="102"><span class="lineNum"> 102 </span><span class="lineNoCov"> 0 : n->next = (BUCKET_CONTENTS *)NULL;</span></a>
|
|
<a name="103"><span class="lineNum"> 103 </span> : }</a>
|
|
<a name="104"><span class="lineNum"> 104 </span> : </a>
|
|
<a name="105"><span class="lineNum"> 105 </span> : return new_bucket; </a>
|
|
<a name="106"><span class="lineNum"> 106 </span> : }</a>
|
|
<a name="107"><span class="lineNum"> 107 </span> : </a>
|
|
<a name="108"><span class="lineNum"> 108 </span> : HASH_TABLE *</a>
|
|
<a name="109"><span class="lineNum"> 109 </span><span class="lineNoCov"> 0 : hash_copy (table, cpdata)</span></a>
|
|
<a name="110"><span class="lineNum"> 110 </span> : HASH_TABLE *table;</a>
|
|
<a name="111"><span class="lineNum"> 111 </span> : sh_string_func_t *cpdata;</a>
|
|
<a name="112"><span class="lineNum"> 112 </span> : {</a>
|
|
<a name="113"><span class="lineNum"> 113 </span><span class="lineNoCov"> 0 : HASH_TABLE *new_table;</span></a>
|
|
<a name="114"><span class="lineNum"> 114 </span><span class="lineNoCov"> 0 : int i;</span></a>
|
|
<a name="115"><span class="lineNum"> 115 </span> : </a>
|
|
<a name="116"><span class="lineNum"> 116 </span><span class="lineNoCov"> 0 : if (table == 0)</span></a>
|
|
<a name="117"><span class="lineNum"> 117 </span> : return ((HASH_TABLE *)NULL);</a>
|
|
<a name="118"><span class="lineNum"> 118 </span> : </a>
|
|
<a name="119"><span class="lineNum"> 119 </span><span class="lineNoCov"> 0 : new_table = hash_create (table->nbuckets);</span></a>
|
|
<a name="120"><span class="lineNum"> 120 </span> : </a>
|
|
<a name="121"><span class="lineNum"> 121 </span><span class="lineNoCov"> 0 : for (i = 0; i < table->nbuckets; i++)</span></a>
|
|
<a name="122"><span class="lineNum"> 122 </span><span class="lineNoCov"> 0 : new_table->bucket_array[i] = copy_bucket_array (table->bucket_array[i], cpdata);</span></a>
|
|
<a name="123"><span class="lineNum"> 123 </span> : </a>
|
|
<a name="124"><span class="lineNum"> 124 </span><span class="lineNoCov"> 0 : new_table->nentries = table->nentries;</span></a>
|
|
<a name="125"><span class="lineNum"> 125 </span><span class="lineNoCov"> 0 : return new_table;</span></a>
|
|
<a name="126"><span class="lineNum"> 126 </span> : }</a>
|
|
<a name="127"><span class="lineNum"> 127 </span> : </a>
|
|
<a name="128"><span class="lineNum"> 128 </span> : /* The `khash' check below requires that strings that compare equally with</a>
|
|
<a name="129"><span class="lineNum"> 129 </span> : strcmp hash to the same value. */</a>
|
|
<a name="130"><span class="lineNum"> 130 </span> : unsigned int</a>
|
|
<a name="131"><span class="lineNum"> 131 </span><span class="lineNoCov"> 0 : hash_string (s)</span></a>
|
|
<a name="132"><span class="lineNum"> 132 </span> : const char *s;</a>
|
|
<a name="133"><span class="lineNum"> 133 </span> : {</a>
|
|
<a name="134"><span class="lineNum"> 134 </span><span class="lineNoCov"> 0 : register unsigned int i;</span></a>
|
|
<a name="135"><span class="lineNum"> 135 </span> : </a>
|
|
<a name="136"><span class="lineNum"> 136 </span> : /* This is the best string hash function I found.</a>
|
|
<a name="137"><span class="lineNum"> 137 </span> : </a>
|
|
<a name="138"><span class="lineNum"> 138 </span> : The magic is in the interesting relationship between the special prime</a>
|
|
<a name="139"><span class="lineNum"> 139 </span> : 16777619 (2^24 + 403) and 2^32 and 2^8. */</a>
|
|
<a name="140"><span class="lineNum"> 140 </span> : </a>
|
|
<a name="141"><span class="lineNum"> 141 </span><span class="lineCov">20618923167 : for (i = 0; *s; s++)</span></a>
|
|
<a name="142"><span class="lineNum"> 142 </span> : {</a>
|
|
<a name="143"><span class="lineNum"> 143 </span><span class="lineCov">18318703917 : i *= 16777619;</span></a>
|
|
<a name="144"><span class="lineNum"> 144 </span><span class="lineCov">18318703917 : i ^= *s;</span></a>
|
|
<a name="145"><span class="lineNum"> 145 </span> : }</a>
|
|
<a name="146"><span class="lineNum"> 146 </span> : </a>
|
|
<a name="147"><span class="lineNum"> 147 </span><span class="lineCov"> 2300219250 : return i;</span></a>
|
|
<a name="148"><span class="lineNum"> 148 </span> : }</a>
|
|
<a name="149"><span class="lineNum"> 149 </span> : </a>
|
|
<a name="150"><span class="lineNum"> 150 </span> : /* Return the location of the bucket which should contain the data</a>
|
|
<a name="151"><span class="lineNum"> 151 </span> : for STRING. TABLE is a pointer to a HASH_TABLE. */</a>
|
|
<a name="152"><span class="lineNum"> 152 </span> : </a>
|
|
<a name="153"><span class="lineNum"> 153 </span> : int</a>
|
|
<a name="154"><span class="lineNum"> 154 </span><span class="lineNoCov"> 0 : hash_bucket (string, table)</span></a>
|
|
<a name="155"><span class="lineNum"> 155 </span> : const char *string;</a>
|
|
<a name="156"><span class="lineNum"> 156 </span> : HASH_TABLE *table;</a>
|
|
<a name="157"><span class="lineNum"> 157 </span> : {</a>
|
|
<a name="158"><span class="lineNum"> 158 </span><span class="lineNoCov"> 0 : unsigned int h;</span></a>
|
|
<a name="159"><span class="lineNum"> 159 </span> : </a>
|
|
<a name="160"><span class="lineNum"> 160 </span><span class="lineNoCov"> 0 : return (HASH_BUCKET (string, table, h));</span></a>
|
|
<a name="161"><span class="lineNum"> 161 </span> : }</a>
|
|
<a name="162"><span class="lineNum"> 162 </span> : </a>
|
|
<a name="163"><span class="lineNum"> 163 </span> : /* Return a pointer to the hashed item. If the HASH_CREATE flag is passed,</a>
|
|
<a name="164"><span class="lineNum"> 164 </span> : create a new hash table entry for STRING, otherwise return NULL. */</a>
|
|
<a name="165"><span class="lineNum"> 165 </span> : BUCKET_CONTENTS *</a>
|
|
<a name="166"><span class="lineNum"> 166 </span><span class="lineCov"> 1670795648 : hash_search (string, table, flags)</span></a>
|
|
<a name="167"><span class="lineNum"> 167 </span> : const char *string;</a>
|
|
<a name="168"><span class="lineNum"> 168 </span> : HASH_TABLE *table;</a>
|
|
<a name="169"><span class="lineNum"> 169 </span> : int flags;</a>
|
|
<a name="170"><span class="lineNum"> 170 </span> : {</a>
|
|
<a name="171"><span class="lineNum"> 171 </span><span class="lineCov"> 1670795648 : BUCKET_CONTENTS *list;</span></a>
|
|
<a name="172"><span class="lineNum"> 172 </span><span class="lineCov"> 1670795648 : int bucket;</span></a>
|
|
<a name="173"><span class="lineNum"> 173 </span><span class="lineCov"> 1670795648 : unsigned int hv;</span></a>
|
|
<a name="174"><span class="lineNum"> 174 </span> : </a>
|
|
<a name="175"><span class="lineNum"> 175 </span><span class="lineCov"> 1670795648 : if (table == 0 || ((flags & HASH_CREATE) == 0 && HASH_ENTRIES (table) == 0))</span></a>
|
|
<a name="176"><span class="lineNum"> 176 </span> : return (BUCKET_CONTENTS *)NULL;</a>
|
|
<a name="177"><span class="lineNum"> 177 </span> : </a>
|
|
<a name="178"><span class="lineNum"> 178 </span><span class="lineCov"> 1575343420 : bucket = HASH_BUCKET (string, table, hv);</span></a>
|
|
<a name="179"><span class="lineNum"> 179 </span> : </a>
|
|
<a name="180"><span class="lineNum"> 180 </span><span class="lineCov"> 3179358040 : for (list = table->bucket_array ? table->bucket_array[bucket] : 0; list; list = list->next)</span></a>
|
|
<a name="181"><span class="lineNum"> 181 </span> : {</a>
|
|
<a name="182"><span class="lineNum"> 182 </span> : /* This is the comparison function */</a>
|
|
<a name="183"><span class="lineNum"> 183 </span><span class="lineCov"> 547255453 : if (hv == list->khash && STREQ (list->key, string))</span></a>
|
|
<a name="184"><span class="lineNum"> 184 </span> : {</a>
|
|
<a name="185"><span class="lineNum"> 185 </span><span class="lineCov"> 518584253 : list->times_found++;</span></a>
|
|
<a name="186"><span class="lineNum"> 186 </span><span class="lineCov"> 518584253 : return (list);</span></a>
|
|
<a name="187"><span class="lineNum"> 187 </span> : }</a>
|
|
<a name="188"><span class="lineNum"> 188 </span> : }</a>
|
|
<a name="189"><span class="lineNum"> 189 </span> : </a>
|
|
<a name="190"><span class="lineNum"> 190 </span><span class="lineCov"> 1056759167 : if (flags & HASH_CREATE)</span></a>
|
|
<a name="191"><span class="lineNum"> 191 </span> : {</a>
|
|
<a name="192"><span class="lineNum"> 192 </span><span class="lineNoCov"> 0 : list = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS));</span></a>
|
|
<a name="193"><span class="lineNum"> 193 </span><span class="lineNoCov"> 0 : list->next = table->bucket_array[bucket];</span></a>
|
|
<a name="194"><span class="lineNum"> 194 </span><span class="lineNoCov"> 0 : table->bucket_array[bucket] = list;</span></a>
|
|
<a name="195"><span class="lineNum"> 195 </span> : </a>
|
|
<a name="196"><span class="lineNum"> 196 </span><span class="lineNoCov"> 0 : list->data = NULL;</span></a>
|
|
<a name="197"><span class="lineNum"> 197 </span><span class="lineNoCov"> 0 : list->key = (char *)string; /* XXX fix later */</span></a>
|
|
<a name="198"><span class="lineNum"> 198 </span><span class="lineNoCov"> 0 : list->khash = hv;</span></a>
|
|
<a name="199"><span class="lineNum"> 199 </span><span class="lineNoCov"> 0 : list->times_found = 0;</span></a>
|
|
<a name="200"><span class="lineNum"> 200 </span> : </a>
|
|
<a name="201"><span class="lineNum"> 201 </span><span class="lineNoCov"> 0 : table->nentries++;</span></a>
|
|
<a name="202"><span class="lineNum"> 202 </span><span class="lineNoCov"> 0 : return (list);</span></a>
|
|
<a name="203"><span class="lineNum"> 203 </span> : }</a>
|
|
<a name="204"><span class="lineNum"> 204 </span> : </a>
|
|
<a name="205"><span class="lineNum"> 205 </span> : return (BUCKET_CONTENTS *)NULL;</a>
|
|
<a name="206"><span class="lineNum"> 206 </span> : }</a>
|
|
<a name="207"><span class="lineNum"> 207 </span> : </a>
|
|
<a name="208"><span class="lineNum"> 208 </span> : /* Remove the item specified by STRING from the hash table TABLE.</a>
|
|
<a name="209"><span class="lineNum"> 209 </span> : The item removed is returned, so you can free its contents. If</a>
|
|
<a name="210"><span class="lineNum"> 210 </span> : the item isn't in this table NULL is returned. */</a>
|
|
<a name="211"><span class="lineNum"> 211 </span> : BUCKET_CONTENTS *</a>
|
|
<a name="212"><span class="lineNum"> 212 </span><span class="lineCov"> 19085998 : hash_remove (string, table, flags)</span></a>
|
|
<a name="213"><span class="lineNum"> 213 </span> : const char *string;</a>
|
|
<a name="214"><span class="lineNum"> 214 </span> : HASH_TABLE *table;</a>
|
|
<a name="215"><span class="lineNum"> 215 </span> : int flags;</a>
|
|
<a name="216"><span class="lineNum"> 216 </span> : {</a>
|
|
<a name="217"><span class="lineNum"> 217 </span><span class="lineCov"> 19085998 : int bucket;</span></a>
|
|
<a name="218"><span class="lineNum"> 218 </span><span class="lineCov"> 19085998 : BUCKET_CONTENTS *prev, *temp;</span></a>
|
|
<a name="219"><span class="lineNum"> 219 </span><span class="lineCov"> 19085998 : unsigned int hv;</span></a>
|
|
<a name="220"><span class="lineNum"> 220 </span> : </a>
|
|
<a name="221"><span class="lineNum"> 221 </span><span class="lineCov"> 19085998 : if (table == 0 || HASH_ENTRIES (table) == 0)</span></a>
|
|
<a name="222"><span class="lineNum"> 222 </span> : return (BUCKET_CONTENTS *)NULL;</a>
|
|
<a name="223"><span class="lineNum"> 223 </span> : </a>
|
|
<a name="224"><span class="lineNum"> 224 </span><span class="lineCov"> 19085989 : bucket = HASH_BUCKET (string, table, hv);</span></a>
|
|
<a name="225"><span class="lineNum"> 225 </span><span class="lineCov"> 19085989 : prev = (BUCKET_CONTENTS *)NULL;</span></a>
|
|
<a name="226"><span class="lineNum"> 226 </span><span class="lineCov"> 19085989 : for (temp = table->bucket_array[bucket]; temp; temp = temp->next)</span></a>
|
|
<a name="227"><span class="lineNum"> 227 </span> : {</a>
|
|
<a name="228"><span class="lineNum"> 228 </span><span class="lineNoCov"> 0 : if (hv == temp->khash && STREQ (temp->key, string))</span></a>
|
|
<a name="229"><span class="lineNum"> 229 </span> : {</a>
|
|
<a name="230"><span class="lineNum"> 230 </span><span class="lineNoCov"> 0 : if (prev)</span></a>
|
|
<a name="231"><span class="lineNum"> 231 </span><span class="lineNoCov"> 0 : prev->next = temp->next;</span></a>
|
|
<a name="232"><span class="lineNum"> 232 </span> : else</a>
|
|
<a name="233"><span class="lineNum"> 233 </span><span class="lineNoCov"> 0 : table->bucket_array[bucket] = temp->next;</span></a>
|
|
<a name="234"><span class="lineNum"> 234 </span> : </a>
|
|
<a name="235"><span class="lineNum"> 235 </span><span class="lineNoCov"> 0 : table->nentries--;</span></a>
|
|
<a name="236"><span class="lineNum"> 236 </span><span class="lineNoCov"> 0 : return (temp);</span></a>
|
|
<a name="237"><span class="lineNum"> 237 </span> : }</a>
|
|
<a name="238"><span class="lineNum"> 238 </span><span class="lineNoCov"> 0 : prev = temp;</span></a>
|
|
<a name="239"><span class="lineNum"> 239 </span> : }</a>
|
|
<a name="240"><span class="lineNum"> 240 </span> : return ((BUCKET_CONTENTS *) NULL);</a>
|
|
<a name="241"><span class="lineNum"> 241 </span> : }</a>
|
|
<a name="242"><span class="lineNum"> 242 </span> : </a>
|
|
<a name="243"><span class="lineNum"> 243 </span> : /* Create an entry for STRING, in TABLE. If the entry already</a>
|
|
<a name="244"><span class="lineNum"> 244 </span> : exists, then return it (unless the HASH_NOSRCH flag is set). */</a>
|
|
<a name="245"><span class="lineNum"> 245 </span> : BUCKET_CONTENTS *</a>
|
|
<a name="246"><span class="lineNum"> 246 </span><span class="lineCov"> 705789841 : hash_insert (string, table, flags)</span></a>
|
|
<a name="247"><span class="lineNum"> 247 </span> : char *string;</a>
|
|
<a name="248"><span class="lineNum"> 248 </span> : HASH_TABLE *table;</a>
|
|
<a name="249"><span class="lineNum"> 249 </span> : int flags;</a>
|
|
<a name="250"><span class="lineNum"> 250 </span> : {</a>
|
|
<a name="251"><span class="lineNum"> 251 </span><span class="lineCov"> 705789841 : BUCKET_CONTENTS *item;</span></a>
|
|
<a name="252"><span class="lineNum"> 252 </span><span class="lineCov"> 705789841 : int bucket;</span></a>
|
|
<a name="253"><span class="lineNum"> 253 </span><span class="lineCov"> 705789841 : unsigned int hv;</span></a>
|
|
<a name="254"><span class="lineNum"> 254 </span> : </a>
|
|
<a name="255"><span class="lineNum"> 255 </span><span class="lineCov"> 705789841 : if (table == 0)</span></a>
|
|
<a name="256"><span class="lineNum"> 256 </span><span class="lineNoCov"> 0 : table = hash_create (0);</span></a>
|
|
<a name="257"><span class="lineNum"> 257 </span> : </a>
|
|
<a name="258"><span class="lineNum"> 258 </span><span class="lineCov"> 705837063 : item = (flags & HASH_NOSRCH) ? (BUCKET_CONTENTS *)NULL</span></a>
|
|
<a name="259"><span class="lineNum"> 259 </span><span class="lineCov"> 705789841 : : hash_search (string, table, 0);</span></a>
|
|
<a name="260"><span class="lineNum"> 260 </span> : </a>
|
|
<a name="261"><span class="lineNum"> 261 </span><span class="lineCov"> 47222 : if (item == 0)</span></a>
|
|
<a name="262"><span class="lineNum"> 262 </span> : {</a>
|
|
<a name="263"><span class="lineNum"> 263 </span><span class="lineCov"> 705789841 : bucket = HASH_BUCKET (string, table, hv);</span></a>
|
|
<a name="264"><span class="lineNum"> 264 </span> : </a>
|
|
<a name="265"><span class="lineNum"> 265 </span><span class="lineCov"> 705789841 : item = (BUCKET_CONTENTS *)xmalloc (sizeof (BUCKET_CONTENTS));</span></a>
|
|
<a name="266"><span class="lineNum"> 266 </span><span class="lineCov"> 705789841 : item->next = table->bucket_array[bucket];</span></a>
|
|
<a name="267"><span class="lineNum"> 267 </span><span class="lineCov"> 705789841 : table->bucket_array[bucket] = item;</span></a>
|
|
<a name="268"><span class="lineNum"> 268 </span> : </a>
|
|
<a name="269"><span class="lineNum"> 269 </span><span class="lineCov"> 705789841 : item->data = NULL;</span></a>
|
|
<a name="270"><span class="lineNum"> 270 </span><span class="lineCov"> 705789841 : item->key = string;</span></a>
|
|
<a name="271"><span class="lineNum"> 271 </span><span class="lineCov"> 705789841 : item->khash = hv;</span></a>
|
|
<a name="272"><span class="lineNum"> 272 </span><span class="lineCov"> 705789841 : item->times_found = 0;</span></a>
|
|
<a name="273"><span class="lineNum"> 273 </span> : </a>
|
|
<a name="274"><span class="lineNum"> 274 </span><span class="lineCov"> 705789841 : table->nentries++;</span></a>
|
|
<a name="275"><span class="lineNum"> 275 </span> : }</a>
|
|
<a name="276"><span class="lineNum"> 276 </span> : </a>
|
|
<a name="277"><span class="lineNum"> 277 </span><span class="lineCov"> 705789841 : return (item);</span></a>
|
|
<a name="278"><span class="lineNum"> 278 </span> : }</a>
|
|
<a name="279"><span class="lineNum"> 279 </span> : </a>
|
|
<a name="280"><span class="lineNum"> 280 </span> : /* Remove and discard all entries in TABLE. If FREE_DATA is non-null, it</a>
|
|
<a name="281"><span class="lineNum"> 281 </span> : is a function to call to dispose of a hash item's data. Otherwise,</a>
|
|
<a name="282"><span class="lineNum"> 282 </span> : free() is called. */</a>
|
|
<a name="283"><span class="lineNum"> 283 </span> : void</a>
|
|
<a name="284"><span class="lineNum"> 284 </span><span class="lineCov"> 6976 : hash_flush (table, free_data)</span></a>
|
|
<a name="285"><span class="lineNum"> 285 </span> : HASH_TABLE *table;</a>
|
|
<a name="286"><span class="lineNum"> 286 </span> : sh_free_func_t *free_data;</a>
|
|
<a name="287"><span class="lineNum"> 287 </span> : {</a>
|
|
<a name="288"><span class="lineNum"> 288 </span><span class="lineCov"> 6976 : int i;</span></a>
|
|
<a name="289"><span class="lineNum"> 289 </span><span class="lineCov"> 6976 : register BUCKET_CONTENTS *bucket, *item;</span></a>
|
|
<a name="290"><span class="lineNum"> 290 </span> : </a>
|
|
<a name="291"><span class="lineNum"> 291 </span><span class="lineCov"> 6976 : if (table == 0 || HASH_ENTRIES (table) == 0)</span></a>
|
|
<a name="292"><span class="lineNum"> 292 </span> : return;</a>
|
|
<a name="293"><span class="lineNum"> 293 </span> : </a>
|
|
<a name="294"><span class="lineNum"> 294 </span><span class="lineCov"> 34835 : for (i = 0; i < table->nbuckets; i++)</span></a>
|
|
<a name="295"><span class="lineNum"> 295 </span> : {</a>
|
|
<a name="296"><span class="lineNum"> 296 </span><span class="lineCov"> 27868 : bucket = table->bucket_array[i];</span></a>
|
|
<a name="297"><span class="lineNum"> 297 </span> : </a>
|
|
<a name="298"><span class="lineNum"> 298 </span><span class="lineCov"> 34835 : while (bucket)</span></a>
|
|
<a name="299"><span class="lineNum"> 299 </span> : {</a>
|
|
<a name="300"><span class="lineNum"> 300 </span><span class="lineCov"> 6967 : item = bucket;</span></a>
|
|
<a name="301"><span class="lineNum"> 301 </span><span class="lineCov"> 6967 : bucket = bucket->next;</span></a>
|
|
<a name="302"><span class="lineNum"> 302 </span> : </a>
|
|
<a name="303"><span class="lineNum"> 303 </span><span class="lineCov"> 6967 : if (free_data)</span></a>
|
|
<a name="304"><span class="lineNum"> 304 </span><span class="lineCov"> 6967 : (*free_data) (item->data);</span></a>
|
|
<a name="305"><span class="lineNum"> 305 </span> : else</a>
|
|
<a name="306"><span class="lineNum"> 306 </span><span class="lineNoCov"> 0 : free (item->data);</span></a>
|
|
<a name="307"><span class="lineNum"> 307 </span><span class="lineCov"> 6967 : free (item->key);</span></a>
|
|
<a name="308"><span class="lineNum"> 308 </span><span class="lineCov"> 6967 : free (item);</span></a>
|
|
<a name="309"><span class="lineNum"> 309 </span> : }</a>
|
|
<a name="310"><span class="lineNum"> 310 </span><span class="lineCov"> 27868 : table->bucket_array[i] = (BUCKET_CONTENTS *)NULL;</span></a>
|
|
<a name="311"><span class="lineNum"> 311 </span> : }</a>
|
|
<a name="312"><span class="lineNum"> 312 </span> : </a>
|
|
<a name="313"><span class="lineNum"> 313 </span><span class="lineCov"> 6967 : table->nentries = 0;</span></a>
|
|
<a name="314"><span class="lineNum"> 314 </span> : }</a>
|
|
<a name="315"><span class="lineNum"> 315 </span> : </a>
|
|
<a name="316"><span class="lineNum"> 316 </span> : /* Free the hash table pointed to by TABLE. */</a>
|
|
<a name="317"><span class="lineNum"> 317 </span> : void</a>
|
|
<a name="318"><span class="lineNum"> 318 </span><span class="lineCov"> 6967 : hash_dispose (table)</span></a>
|
|
<a name="319"><span class="lineNum"> 319 </span> : HASH_TABLE *table;</a>
|
|
<a name="320"><span class="lineNum"> 320 </span> : {</a>
|
|
<a name="321"><span class="lineNum"> 321 </span><span class="lineCov"> 6967 : free (table->bucket_array);</span></a>
|
|
<a name="322"><span class="lineNum"> 322 </span><span class="lineCov"> 6967 : free (table);</span></a>
|
|
<a name="323"><span class="lineNum"> 323 </span><span class="lineCov"> 6967 : }</span></a>
|
|
<a name="324"><span class="lineNum"> 324 </span> : </a>
|
|
<a name="325"><span class="lineNum"> 325 </span> : void</a>
|
|
<a name="326"><span class="lineNum"> 326 </span><span class="lineNoCov"> 0 : hash_walk (table, func)</span></a>
|
|
<a name="327"><span class="lineNum"> 327 </span> : HASH_TABLE *table;</a>
|
|
<a name="328"><span class="lineNum"> 328 </span> : hash_wfunc *func;</a>
|
|
<a name="329"><span class="lineNum"> 329 </span> : {</a>
|
|
<a name="330"><span class="lineNum"> 330 </span><span class="lineNoCov"> 0 : register int i;</span></a>
|
|
<a name="331"><span class="lineNum"> 331 </span><span class="lineNoCov"> 0 : BUCKET_CONTENTS *item;</span></a>
|
|
<a name="332"><span class="lineNum"> 332 </span> : </a>
|
|
<a name="333"><span class="lineNum"> 333 </span><span class="lineNoCov"> 0 : if (table == 0 || HASH_ENTRIES (table) == 0)</span></a>
|
|
<a name="334"><span class="lineNum"> 334 </span> : return;</a>
|
|
<a name="335"><span class="lineNum"> 335 </span> : </a>
|
|
<a name="336"><span class="lineNum"> 336 </span><span class="lineNoCov"> 0 : for (i = 0; i < table->nbuckets; i++)</span></a>
|
|
<a name="337"><span class="lineNum"> 337 </span> : {</a>
|
|
<a name="338"><span class="lineNum"> 338 </span><span class="lineNoCov"> 0 : for (item = hash_items (i, table); item; item = item->next)</span></a>
|
|
<a name="339"><span class="lineNum"> 339 </span><span class="lineNoCov"> 0 : if ((*func) (item) < 0)</span></a>
|
|
<a name="340"><span class="lineNum"> 340 </span> : return;</a>
|
|
<a name="341"><span class="lineNum"> 341 </span> : }</a>
|
|
<a name="342"><span class="lineNum"> 342 </span> : }</a>
|
|
<a name="343"><span class="lineNum"> 343 </span> : </a>
|
|
<a name="344"><span class="lineNum"> 344 </span> : #if defined (DEBUG) || defined (TEST_HASHING)</a>
|
|
<a name="345"><span class="lineNum"> 345 </span> : void</a>
|
|
<a name="346"><span class="lineNum"> 346 </span> : hash_pstats (table, name)</a>
|
|
<a name="347"><span class="lineNum"> 347 </span> : HASH_TABLE *table;</a>
|
|
<a name="348"><span class="lineNum"> 348 </span> : char *name;</a>
|
|
<a name="349"><span class="lineNum"> 349 </span> : {</a>
|
|
<a name="350"><span class="lineNum"> 350 </span> : register int slot, bcount;</a>
|
|
<a name="351"><span class="lineNum"> 351 </span> : register BUCKET_CONTENTS *bc;</a>
|
|
<a name="352"><span class="lineNum"> 352 </span> : </a>
|
|
<a name="353"><span class="lineNum"> 353 </span> : if (name == 0)</a>
|
|
<a name="354"><span class="lineNum"> 354 </span> : name = "unknown hash table";</a>
|
|
<a name="355"><span class="lineNum"> 355 </span> : </a>
|
|
<a name="356"><span class="lineNum"> 356 </span> : fprintf (stderr, "%s: %d buckets; %d items\n", name, table->nbuckets, table->nentries);</a>
|
|
<a name="357"><span class="lineNum"> 357 </span> : </a>
|
|
<a name="358"><span class="lineNum"> 358 </span> : /* Print out a count of how many strings hashed to each bucket, so we can</a>
|
|
<a name="359"><span class="lineNum"> 359 </span> : see how even the distribution is. */</a>
|
|
<a name="360"><span class="lineNum"> 360 </span> : for (slot = 0; slot < table->nbuckets; slot++)</a>
|
|
<a name="361"><span class="lineNum"> 361 </span> : {</a>
|
|
<a name="362"><span class="lineNum"> 362 </span> : bc = hash_items (slot, table);</a>
|
|
<a name="363"><span class="lineNum"> 363 </span> : </a>
|
|
<a name="364"><span class="lineNum"> 364 </span> : fprintf (stderr, "\tslot %3d: ", slot);</a>
|
|
<a name="365"><span class="lineNum"> 365 </span> : for (bcount = 0; bc; bc = bc->next)</a>
|
|
<a name="366"><span class="lineNum"> 366 </span> : bcount++;</a>
|
|
<a name="367"><span class="lineNum"> 367 </span> : </a>
|
|
<a name="368"><span class="lineNum"> 368 </span> : fprintf (stderr, "%d\n", bcount);</a>
|
|
<a name="369"><span class="lineNum"> 369 </span> : }</a>
|
|
<a name="370"><span class="lineNum"> 370 </span> : }</a>
|
|
<a name="371"><span class="lineNum"> 371 </span> : #endif</a>
|
|
<a name="372"><span class="lineNum"> 372 </span> : </a>
|
|
<a name="373"><span class="lineNum"> 373 </span> : #ifdef TEST_HASHING</a>
|
|
<a name="374"><span class="lineNum"> 374 </span> : </a>
|
|
<a name="375"><span class="lineNum"> 375 </span> : /* link with xmalloc.o and lib/malloc/libmalloc.a */</a>
|
|
<a name="376"><span class="lineNum"> 376 </span> : #undef NULL</a>
|
|
<a name="377"><span class="lineNum"> 377 </span> : #include <stdio.h></a>
|
|
<a name="378"><span class="lineNum"> 378 </span> : </a>
|
|
<a name="379"><span class="lineNum"> 379 </span> : #ifndef NULL</a>
|
|
<a name="380"><span class="lineNum"> 380 </span> : #define NULL 0</a>
|
|
<a name="381"><span class="lineNum"> 381 </span> : #endif</a>
|
|
<a name="382"><span class="lineNum"> 382 </span> : </a>
|
|
<a name="383"><span class="lineNum"> 383 </span> : HASH_TABLE *table, *ntable;</a>
|
|
<a name="384"><span class="lineNum"> 384 </span> : </a>
|
|
<a name="385"><span class="lineNum"> 385 </span> : int interrupt_immediately = 0;</a>
|
|
<a name="386"><span class="lineNum"> 386 </span> : </a>
|
|
<a name="387"><span class="lineNum"> 387 </span> : int</a>
|
|
<a name="388"><span class="lineNum"> 388 </span> : signal_is_trapped (s)</a>
|
|
<a name="389"><span class="lineNum"> 389 </span> : int s;</a>
|
|
<a name="390"><span class="lineNum"> 390 </span> : {</a>
|
|
<a name="391"><span class="lineNum"> 391 </span> : return (0);</a>
|
|
<a name="392"><span class="lineNum"> 392 </span> : }</a>
|
|
<a name="393"><span class="lineNum"> 393 </span> : </a>
|
|
<a name="394"><span class="lineNum"> 394 </span> : void</a>
|
|
<a name="395"><span class="lineNum"> 395 </span> : programming_error (const char *format, ...)</a>
|
|
<a name="396"><span class="lineNum"> 396 </span> : {</a>
|
|
<a name="397"><span class="lineNum"> 397 </span> : abort();</a>
|
|
<a name="398"><span class="lineNum"> 398 </span> : }</a>
|
|
<a name="399"><span class="lineNum"> 399 </span> : </a>
|
|
<a name="400"><span class="lineNum"> 400 </span> : void</a>
|
|
<a name="401"><span class="lineNum"> 401 </span> : fatal_error (const char *format, ...)</a>
|
|
<a name="402"><span class="lineNum"> 402 </span> : {</a>
|
|
<a name="403"><span class="lineNum"> 403 </span> : abort();</a>
|
|
<a name="404"><span class="lineNum"> 404 </span> : }</a>
|
|
<a name="405"><span class="lineNum"> 405 </span> : </a>
|
|
<a name="406"><span class="lineNum"> 406 </span> : void</a>
|
|
<a name="407"><span class="lineNum"> 407 </span> : internal_warning (const char *format, ...)</a>
|
|
<a name="408"><span class="lineNum"> 408 </span> : {</a>
|
|
<a name="409"><span class="lineNum"> 409 </span> : }</a>
|
|
<a name="410"><span class="lineNum"> 410 </span> : </a>
|
|
<a name="411"><span class="lineNum"> 411 </span> : main ()</a>
|
|
<a name="412"><span class="lineNum"> 412 </span> : {</a>
|
|
<a name="413"><span class="lineNum"> 413 </span> : char string[256];</a>
|
|
<a name="414"><span class="lineNum"> 414 </span> : int count = 0;</a>
|
|
<a name="415"><span class="lineNum"> 415 </span> : BUCKET_CONTENTS *tt;</a>
|
|
<a name="416"><span class="lineNum"> 416 </span> : </a>
|
|
<a name="417"><span class="lineNum"> 417 </span> : #if defined (TEST_NBUCKETS)</a>
|
|
<a name="418"><span class="lineNum"> 418 </span> : table = hash_create (TEST_NBUCKETS);</a>
|
|
<a name="419"><span class="lineNum"> 419 </span> : #else</a>
|
|
<a name="420"><span class="lineNum"> 420 </span> : table = hash_create (0);</a>
|
|
<a name="421"><span class="lineNum"> 421 </span> : #endif</a>
|
|
<a name="422"><span class="lineNum"> 422 </span> : </a>
|
|
<a name="423"><span class="lineNum"> 423 </span> : for (;;)</a>
|
|
<a name="424"><span class="lineNum"> 424 </span> : {</a>
|
|
<a name="425"><span class="lineNum"> 425 </span> : char *temp_string;</a>
|
|
<a name="426"><span class="lineNum"> 426 </span> : if (fgets (string, sizeof (string), stdin) == 0)</a>
|
|
<a name="427"><span class="lineNum"> 427 </span> : break;</a>
|
|
<a name="428"><span class="lineNum"> 428 </span> : if (!*string)</a>
|
|
<a name="429"><span class="lineNum"> 429 </span> : break;</a>
|
|
<a name="430"><span class="lineNum"> 430 </span> : temp_string = savestring (string);</a>
|
|
<a name="431"><span class="lineNum"> 431 </span> : tt = hash_insert (temp_string, table, 0);</a>
|
|
<a name="432"><span class="lineNum"> 432 </span> : if (tt->times_found)</a>
|
|
<a name="433"><span class="lineNum"> 433 </span> : {</a>
|
|
<a name="434"><span class="lineNum"> 434 </span> : fprintf (stderr, "You have already added item `%s'\n", string);</a>
|
|
<a name="435"><span class="lineNum"> 435 </span> : free (temp_string);</a>
|
|
<a name="436"><span class="lineNum"> 436 </span> : }</a>
|
|
<a name="437"><span class="lineNum"> 437 </span> : else</a>
|
|
<a name="438"><span class="lineNum"> 438 </span> : {</a>
|
|
<a name="439"><span class="lineNum"> 439 </span> : count++;</a>
|
|
<a name="440"><span class="lineNum"> 440 </span> : }</a>
|
|
<a name="441"><span class="lineNum"> 441 </span> : }</a>
|
|
<a name="442"><span class="lineNum"> 442 </span> : </a>
|
|
<a name="443"><span class="lineNum"> 443 </span> : hash_pstats (table, "hash test");</a>
|
|
<a name="444"><span class="lineNum"> 444 </span> : </a>
|
|
<a name="445"><span class="lineNum"> 445 </span> : ntable = hash_copy (table, (sh_string_func_t *)NULL);</a>
|
|
<a name="446"><span class="lineNum"> 446 </span> : hash_flush (table, (sh_free_func_t *)NULL);</a>
|
|
<a name="447"><span class="lineNum"> 447 </span> : hash_pstats (ntable, "hash copy test");</a>
|
|
<a name="448"><span class="lineNum"> 448 </span> : </a>
|
|
<a name="449"><span class="lineNum"> 449 </span> : exit (0);</a>
|
|
<a name="450"><span class="lineNum"> 450 </span> : }</a>
|
|
<a name="451"><span class="lineNum"> 451 </span> : </a>
|
|
<a name="452"><span class="lineNum"> 452 </span> : #endif /* TEST_HASHING */</a>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.14.0.6.4058</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|