aaru-dps/libaaruformat
1
0
Fork 0
mirror of https://github.com/aaru-dps/libaaruformat.git synced 2025-12-16 19:24:40 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
55b688c5227965173f8cd40a12aa864f7e0a3bcc
libaaruformat/docs/html/lru_8c_source.html

199 lines
23 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libaaruformat: src/lru.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">libaaruformat<span id="projectnumber">&#160;1.0</span>
</div>
<div id="projectbrief">Aaru Data Preservation Suite - Format Library</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('lru_8c_source.html','',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">lru.c</div></div>
</div><!--header-->
<div class="contents">
<a href="lru_8c.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="preprocessor">#include &lt;inttypes.h&gt;</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="preprocessor">#include &lt;stddef.h&gt;</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="preprocessor">#include &lt;stdlib.h&gt;</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="preprocessor">#include &lt;string.h&gt;</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="preprocessor">#include &lt;uthash.h&gt;</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span> </div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="preprocessor">#include &lt;<a class="code" href="aaruformat_8h.html">aaruformat.h</a>&gt;</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span> </div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// this is an example of how to do a LRU cache in C using uthash</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// http://uthash.sourceforge.net/</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// by Jehiah Czebotar 2011 - jehiah@gmail.com</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment">// this code is in the public domain http://unlicense.org/</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span></div>
<div class="foldopen" id="foldopen00024" data-start="{" data-end="}">
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="lru_8h.html#ac7008173fc7e392fa825c69410920f0a"> 24</a></span><span class="keywordtype">void</span> *<a class="code hl_function" href="lru_8c.html#ac7008173fc7e392fa825c69410920f0a">find_in_cache</a>(<span class="keyword">struct</span> <a class="code hl_struct" href="structCacheHeader.html">CacheHeader</a> *cache, <span class="keyword">const</span> <span class="keywordtype">char</span> *key)</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span>{</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">struct </span><a class="code hl_struct" href="structCacheEntry.html">CacheEntry</a> *entry;</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> HASH_FIND_STR(cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">cache</a>, <a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>, entry);</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> <span class="keywordflow">if</span>(entry)</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> {</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// remove it (so the subsequent add will throw it on the front of the list)</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> HASH_DELETE(<a class="code hl_variable" href="structCacheEntry.html#ae7e5f03fa52b88d99e27e2433623b4f5">hh</a>, cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">cache</a>, entry);</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> HASH_ADD_KEYPTR(<a class="code hl_variable" href="structCacheEntry.html#ae7e5f03fa52b88d99e27e2433623b4f5">hh</a>, cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">cache</a>, entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>, strlen(entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>), entry);</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keywordflow">return</span> entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#a7d6d1ed0aab03cffbb34aff16f6f3d56">value</a>;</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> }</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span>}</div>
</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span></div>
<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="lru_8h.html#a962bb6b97fb208cbd8a5932afb60e680"> 47</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="lru_8c.html#a962bb6b97fb208cbd8a5932afb60e680">add_to_cache</a>(<span class="keyword">struct</span> <a class="code hl_struct" href="structCacheHeader.html">CacheHeader</a> *cache, <span class="keyword">const</span> <span class="keywordtype">char</span> *<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>, <span class="keywordtype">void</span> *<a class="code hl_variable" href="structCacheEntry.html#a7d6d1ed0aab03cffbb34aff16f6f3d56">value</a>)</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>{</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">struct </span><a class="code hl_struct" href="structCacheEntry.html">CacheEntry</a> *entry;</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// TODO: Is this needed or we&#39;re just losing cycles? uthash does not free the entry</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> entry = malloc(<span class="keyword">sizeof</span>(<span class="keyword">struct</span> <a class="code hl_struct" href="structCacheEntry.html">CacheEntry</a>));</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a> = strdup(<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>);</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#a7d6d1ed0aab03cffbb34aff16f6f3d56">value</a> = <a class="code hl_variable" href="structCacheEntry.html#a7d6d1ed0aab03cffbb34aff16f6f3d56">value</a>;</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> HASH_ADD_KEYPTR(<a class="code hl_variable" href="structCacheEntry.html#ae7e5f03fa52b88d99e27e2433623b4f5">hh</a>, cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">cache</a>, entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>, strlen(entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>), entry);</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// prune the cache to MAX_CACHE_SIZE</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordflow">if</span>(HASH_COUNT(cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">cache</a>) &gt;= cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#ad3b962f8ce6c6115143cf581c7936e55">max_items</a>)</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> {</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">struct </span><a class="code hl_struct" href="structCacheEntry.html">CacheEntry</a> *tmp_entry;</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> HASH_ITER(<a class="code hl_variable" href="structCacheEntry.html#ae7e5f03fa52b88d99e27e2433623b4f5">hh</a>, cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">cache</a>, entry, tmp_entry)</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> {</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// prune the first entry (loop is based on insertion order so this deletes the oldest item)</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> HASH_DELETE(<a class="code hl_variable" href="structCacheEntry.html#ae7e5f03fa52b88d99e27e2433623b4f5">hh</a>, cache-&gt;<a class="code hl_variable" href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">cache</a>, entry);</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> free(entry-&gt;<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>);</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> free(entry);</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> }</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span>}</div>
</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="lru_8c.html#a8c8313d05785802938c6d8a2a7fa3e09"> 71</a></span><a class="code hl_define" href="decls_8h.html#ac032d233a8ebfcd82fd49d0824eefb18">FORCE_INLINE</a> <span class="keywordtype">char</span> *uint64_to_string(<span class="keyword">const</span> uint64_t number)</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span>{</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordtype">char</span> *char_key = malloc(17); <span class="comment">// 16 hex digits + null terminator</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">if</span>(!char_key) <span class="keywordflow">return</span> NULL;</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> snprintf(char_key, 17, <span class="stringliteral">&quot;%016&quot;</span> PRIX64, number);</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">return</span> char_key;</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span>}</div>
</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span></div>
<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="lru_8h.html#a8cb7ac8e057627210732ee61d2966e35"> 88</a></span><span class="keywordtype">void</span> *<a class="code hl_function" href="lru_8c.html#af628823e6826f0d0e0aa52f96fc74f02">find_in_cache_uint64</a>(<span class="keyword">struct</span> <a class="code hl_struct" href="structCacheHeader.html">CacheHeader</a> *cache, <span class="keyword">const</span> uint64_t <a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>)</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span>{</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">return</span> <a class="code hl_function" href="lru_8c.html#ac7008173fc7e392fa825c69410920f0a">find_in_cache</a>(cache, uint64_to_string(<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>));</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span>}</div>
</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span></div>
<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="lru_8h.html#a0735969939ca80db3fe439ed92b787bb"> 102</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="lru_8c.html#a06d1782c0ae7cb53efa1b5e0f63c5ccb">add_to_cache_uint64</a>(<span class="keyword">struct</span> <a class="code hl_struct" href="structCacheHeader.html">CacheHeader</a> *cache, <span class="keyword">const</span> uint64_t <a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>, <span class="keywordtype">void</span> *<a class="code hl_variable" href="structCacheEntry.html#a7d6d1ed0aab03cffbb34aff16f6f3d56">value</a>)</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span>{</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> <a class="code hl_function" href="lru_8c.html#a962bb6b97fb208cbd8a5932afb60e680">add_to_cache</a>(cache, uint64_to_string(<a class="code hl_variable" href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">key</a>), <a class="code hl_variable" href="structCacheEntry.html#a7d6d1ed0aab03cffbb34aff16f6f3d56">value</a>);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
</div>
<div class="ttc" id="aaaruformat_8h_html"><div class="ttname"><a href="aaruformat_8h.html">aaruformat.h</a></div></div>
<div class="ttc" id="adecls_8h_html_ac032d233a8ebfcd82fd49d0824eefb18"><div class="ttname"><a href="decls_8h.html#ac032d233a8ebfcd82fd49d0824eefb18">FORCE_INLINE</a></div><div class="ttdeci">#define FORCE_INLINE</div><div class="ttdef"><b>Definition</b> <a href="decls_8h_source.html#l00063">decls.h:63</a></div></div>
<div class="ttc" id="alru_8c_html_a06d1782c0ae7cb53efa1b5e0f63c5ccb"><div class="ttname"><a href="lru_8c.html#a06d1782c0ae7cb53efa1b5e0f63c5ccb">add_to_cache_uint64</a></div><div class="ttdeci">void add_to_cache_uint64(struct CacheHeader *cache, const uint64_t key, void *value)</div><div class="ttdoc">Adds a value to the cache with a uint64_t key, using string conversion.</div><div class="ttdef"><b>Definition</b> <a href="#l00102">lru.c:102</a></div></div>
<div class="ttc" id="alru_8c_html_a962bb6b97fb208cbd8a5932afb60e680"><div class="ttname"><a href="lru_8c.html#a962bb6b97fb208cbd8a5932afb60e680">add_to_cache</a></div><div class="ttdeci">void add_to_cache(struct CacheHeader *cache, const char *key, void *value)</div><div class="ttdoc">Adds a value to the cache with a string key, pruning if necessary.</div><div class="ttdef"><b>Definition</b> <a href="#l00047">lru.c:47</a></div></div>
<div class="ttc" id="alru_8c_html_ac7008173fc7e392fa825c69410920f0a"><div class="ttname"><a href="lru_8c.html#ac7008173fc7e392fa825c69410920f0a">find_in_cache</a></div><div class="ttdeci">void * find_in_cache(struct CacheHeader *cache, const char *key)</div><div class="ttdoc">Finds a value in the cache by string key.</div><div class="ttdef"><b>Definition</b> <a href="#l00024">lru.c:24</a></div></div>
<div class="ttc" id="alru_8c_html_af628823e6826f0d0e0aa52f96fc74f02"><div class="ttname"><a href="lru_8c.html#af628823e6826f0d0e0aa52f96fc74f02">find_in_cache_uint64</a></div><div class="ttdeci">void * find_in_cache_uint64(struct CacheHeader *cache, const uint64_t key)</div><div class="ttdoc">Finds a value in the cache by uint64_t key, using string conversion.</div><div class="ttdef"><b>Definition</b> <a href="#l00088">lru.c:88</a></div></div>
<div class="ttc" id="astructCacheEntry_html"><div class="ttname"><a href="structCacheEntry.html">CacheEntry</a></div><div class="ttdoc">Single hash entry in the in-memory cache.</div><div class="ttdef"><b>Definition</b> <a href="lru_8h_source.html#l00026">lru.h:27</a></div></div>
<div class="ttc" id="astructCacheEntry_html_a7d6d1ed0aab03cffbb34aff16f6f3d56"><div class="ttname"><a href="structCacheEntry.html#a7d6d1ed0aab03cffbb34aff16f6f3d56">CacheEntry::value</a></div><div class="ttdeci">void * value</div><div class="ttdoc">Opaque value pointer associated with key (not freed automatically on eviction/clear).</div><div class="ttdef"><b>Definition</b> <a href="lru_8h_source.html#l00029">lru.h:29</a></div></div>
<div class="ttc" id="astructCacheEntry_html_ae7e5f03fa52b88d99e27e2433623b4f5"><div class="ttname"><a href="structCacheEntry.html#ae7e5f03fa52b88d99e27e2433623b4f5">CacheEntry::hh</a></div><div class="ttdeci">UT_hash_handle hh</div><div class="ttdoc">uthash handle linking this entry into the hash table (must remain last or per uthash docs).</div><div class="ttdef"><b>Definition</b> <a href="lru_8h_source.html#l00030">lru.h:30</a></div></div>
<div class="ttc" id="astructCacheEntry_html_aeb007cfa604b485f120ec1f7526c95f4"><div class="ttname"><a href="structCacheEntry.html#aeb007cfa604b485f120ec1f7526c95f4">CacheEntry::key</a></div><div class="ttdeci">char * key</div><div class="ttdoc">Null-terminated key string (unique within the cache). May encode numeric keys.</div><div class="ttdef"><b>Definition</b> <a href="lru_8h_source.html#l00028">lru.h:28</a></div></div>
<div class="ttc" id="astructCacheHeader_html"><div class="ttname"><a href="structCacheHeader.html">CacheHeader</a></div><div class="ttdoc">Cache top-level descriptor encapsulating the hash table root and capacity limit.</div><div class="ttdef"><b>Definition</b> <a href="lru_8h_source.html#l00045">lru.h:46</a></div></div>
<div class="ttc" id="astructCacheHeader_html_a44229bb929d8949f3c2700d07123d224"><div class="ttname"><a href="structCacheHeader.html#a44229bb929d8949f3c2700d07123d224">CacheHeader::cache</a></div><div class="ttdeci">struct CacheEntry * cache</div><div class="ttdoc">Hash root (uthash). NULL when empty.</div><div class="ttdef"><b>Definition</b> <a href="lru_8h_source.html#l00048">lru.h:48</a></div></div>
<div class="ttc" id="astructCacheHeader_html_ad3b962f8ce6c6115143cf581c7936e55"><div class="ttname"><a href="structCacheHeader.html#ad3b962f8ce6c6115143cf581c7936e55">CacheHeader::max_items</a></div><div class="ttdeci">uint64_t max_items</div><div class="ttdoc">Hard limit for number of entries (policy: enforce/ignore depends on implementation).</div><div class="ttdef"><b>Definition</b> <a href="lru_8h_source.html#l00047">lru.h:47</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a href="lru_8c.html">lru.c</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink