snapraid/cov/tommyds/tommytypes.h.gcov.html

586 lines
52 KiB
HTML
Raw Normal View History

2011-03-01 22:19:30 +01:00
<!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 - lcov.info - tommyds/tommytypes.h</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>
2017-12-11 23:00:27 +01:00
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">tommyds</a> - tommytypes.h<span style="font-size: 80%;"> (source / <a href="tommytypes.h.func-sort-c.html">functions</a>)</span></td>
2011-03-01 22:19:30 +01:00
<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">lcov.info</td>
<td></td>
<td class="headerItem">Lines:</td>
2016-11-06 18:12:17 +01:00
<td class="headerCovTableEntry">6</td>
<td class="headerCovTableEntry">6</td>
2011-03-01 22:19:30 +01:00
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
2026-04-29 15:08:50 +02:00
<td class="headerValue">2026-04-29 15:04:44</td>
2011-03-01 22:19:30 +01:00
<td></td>
<td class="headerItem">Functions:</td>
2016-11-06 18:12:17 +01:00
<td class="headerCovTableEntry">3</td>
<td class="headerCovTableEntry">3</td>
2011-03-01 22:19:30 +01:00
<td class="headerCovTableEntryHi">100.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">
2026-04-29 15:08:50 +02:00
<a name="1"><span class="lineNum"> 1 </span> : // SPDX-License-Identifier: BSD-2-Clause</a>
<a name="2"><span class="lineNum"> 2 </span> : // Copyright (C) 2010 Andrea Mazzoleni</a>
<a name="3"><span class="lineNum"> 3 </span> : </a>
<a name="4"><span class="lineNum"> 4 </span> : /** \file</a>
<a name="5"><span class="lineNum"> 5 </span> : * Generic types.</a>
<a name="6"><span class="lineNum"> 6 </span> : */</a>
<a name="7"><span class="lineNum"> 7 </span> : </a>
<a name="8"><span class="lineNum"> 8 </span> : #ifndef __TOMMYTYPES_H</a>
<a name="9"><span class="lineNum"> 9 </span> : #define __TOMMYTYPES_H</a>
<a name="10"><span class="lineNum"> 10 </span> : </a>
<a name="11"><span class="lineNum"> 11 </span> : /******************************************************************************/</a>
<a name="12"><span class="lineNum"> 12 </span> : /* types */</a>
<a name="13"><span class="lineNum"> 13 </span> : </a>
<a name="14"><span class="lineNum"> 14 </span> : #include &lt;stddef.h&gt;</a>
<a name="15"><span class="lineNum"> 15 </span> : </a>
<a name="16"><span class="lineNum"> 16 </span> : #ifdef _MSC_VER</a>
<a name="17"><span class="lineNum"> 17 </span> : typedef unsigned tommy_uint32_t; /**&lt; Generic uint32_t type. */</a>
<a name="18"><span class="lineNum"> 18 </span> : typedef unsigned _int64 tommy_uint64_t; /**&lt; Generic uint64_t type. */</a>
<a name="19"><span class="lineNum"> 19 </span> : typedef size_t tommy_uintptr_t; /**&lt; Generic uintptr_t type. */</a>
<a name="20"><span class="lineNum"> 20 </span> : #ifdef _WIN64</a>
<a name="21"><span class="lineNum"> 21 </span> : #define TOMMY_SIZE_BIT 64</a>
<a name="22"><span class="lineNum"> 22 </span> : typedef unsigned _int64 tommy_size_t; /**&lt; Generic size_t type. */</a>
<a name="23"><span class="lineNum"> 23 </span> : typedef _int64 tommy_ssize_t; /**&lt; Generic ssize_t type. */</a>
<a name="24"><span class="lineNum"> 24 </span> : #else</a>
<a name="25"><span class="lineNum"> 25 </span> : #define TOMMY_SIZE_BIT 32</a>
<a name="26"><span class="lineNum"> 26 </span> : typedef unsigned tommy_size_t; /**&lt; Generic size_t type. */</a>
<a name="27"><span class="lineNum"> 27 </span> : typedef int tommy_ssize_t; /**&lt; Generic ssize_t type. */</a>
<a name="28"><span class="lineNum"> 28 </span> : #endif</a>
<a name="29"><span class="lineNum"> 29 </span> : #else</a>
<a name="30"><span class="lineNum"> 30 </span> : #include &lt;stdint.h&gt;</a>
<a name="31"><span class="lineNum"> 31 </span> : typedef uint32_t tommy_uint32_t; /**&lt; Generic uint32_t type. */</a>
<a name="32"><span class="lineNum"> 32 </span> : typedef uint64_t tommy_uint64_t; /**&lt; Generic uint64_t type. */</a>
<a name="33"><span class="lineNum"> 33 </span> : typedef uintptr_t tommy_uintptr_t; /**&lt; Generic uintptr_t type. */</a>
<a name="34"><span class="lineNum"> 34 </span> : #if SIZE_MAX == UINT64_MAX</a>
<a name="35"><span class="lineNum"> 35 </span> : #define TOMMY_SIZE_BIT 64</a>
<a name="36"><span class="lineNum"> 36 </span> : typedef uint64_t tommy_size_t; /**&lt; Generic size_t type. */</a>
<a name="37"><span class="lineNum"> 37 </span> : typedef int64_t tommy_ssize_t; /**&lt; Generic ssize_t type. */</a>
<a name="38"><span class="lineNum"> 38 </span> : #elif SIZE_MAX == UINT32_MAX</a>
<a name="39"><span class="lineNum"> 39 </span> : #define TOMMY_SIZE_BIT 32</a>
<a name="40"><span class="lineNum"> 40 </span> : typedef uint32_t tommy_size_t; /**&lt; Generic size_t type. */</a>
<a name="41"><span class="lineNum"> 41 </span> : typedef int32_t tommy_ssize_t; /**&lt; Generic ssize_t type. */</a>
<a name="42"><span class="lineNum"> 42 </span> : #else</a>
<a name="43"><span class="lineNum"> 43 </span> : #error Unsupported SIZE_MAX</a>
<a name="44"><span class="lineNum"> 44 </span> : #endif</a>
<a name="45"><span class="lineNum"> 45 </span> : #endif</a>
<a name="46"><span class="lineNum"> 46 </span> : </a>
<a name="47"><span class="lineNum"> 47 </span> : typedef ptrdiff_t tommy_ptrdiff_t; /**&lt; Generic ptrdiff_t type. */</a>
<a name="48"><span class="lineNum"> 48 </span> : typedef int tommy_bool_t; /**&lt; Generic boolean type. */</a>
<a name="49"><span class="lineNum"> 49 </span> : </a>
<a name="50"><span class="lineNum"> 50 </span> : /**</a>
<a name="51"><span class="lineNum"> 51 </span> : * Generic unsigned integer type.</a>
<a name="52"><span class="lineNum"> 52 </span> : *</a>
<a name="53"><span class="lineNum"> 53 </span> : * It has no specific size, as it is used to store only small values.</a>
<a name="54"><span class="lineNum"> 54 </span> : * To make the code more efficient, a full 32 bit integer is used.</a>
<a name="55"><span class="lineNum"> 55 </span> : */</a>
<a name="56"><span class="lineNum"> 56 </span> : typedef tommy_uint32_t tommy_uint_t;</a>
<a name="57"><span class="lineNum"> 57 </span> : </a>
<a name="58"><span class="lineNum"> 58 </span> : /** \internal</a>
<a name="59"><span class="lineNum"> 59 </span> : * Explicit cast helper used to smooth out the difference between C and C++.</a>
<a name="60"><span class="lineNum"> 60 </span> : *</a>
<a name="61"><span class="lineNum"> 61 </span> : * In C, a void* can be assigned to any pointer type without an explicit cast.</a>
<a name="62"><span class="lineNum"> 62 </span> : * This is not allowed in C++, where converting a void* to another pointer type</a>
<a name="63"><span class="lineNum"> 63 </span> : * always requires an explicit cast.</a>
<a name="64"><span class="lineNum"> 64 </span> : *</a>
<a name="65"><span class="lineNum"> 65 </span> : * tommy_cast should be used only for this specific purpose, so it should be</a>
<a name="66"><span class="lineNum"> 66 </span> : * applied when converting a void* to a more specific pointer type in code that</a>
<a name="67"><span class="lineNum"> 67 </span> : * must compile as both C and C++. It is not intended for arbitrary pointer</a>
<a name="68"><span class="lineNum"> 68 </span> : * conversions or for casts that are unrelated to the C to C++ difference.</a>
<a name="69"><span class="lineNum"> 69 </span> : */</a>
<a name="70"><span class="lineNum"> 70 </span> : #ifdef __cplusplus</a>
<a name="71"><span class="lineNum"> 71 </span> : #define tommy_cast(type, value) static_cast&lt;type&gt;(value)</a>
<a name="72"><span class="lineNum"> 72 </span> : #else</a>
<a name="73"><span class="lineNum"> 73 </span> : #define tommy_cast(type, value) (value)</a>
<a name="74"><span class="lineNum"> 74 </span> : #endif</a>
<a name="75"><span class="lineNum"> 75 </span> : </a>
<a name="76"><span class="lineNum"> 76 </span> : /******************************************************************************/</a>
<a name="77"><span class="lineNum"> 77 </span> : /* heap */</a>
<a name="78"><span class="lineNum"> 78 </span> : </a>
<a name="79"><span class="lineNum"> 79 </span> : /* by default uses malloc/calloc/realloc/free */</a>
<a name="80"><span class="lineNum"> 80 </span> : </a>
<a name="81"><span class="lineNum"> 81 </span> : /**</a>
<a name="82"><span class="lineNum"> 82 </span> : * Generic malloc(), calloc(), realloc() and free() functions.</a>
<a name="83"><span class="lineNum"> 83 </span> : * Redefine them to what you need. By default they map to the C malloc(), calloc(), realloc() and free().</a>
<a name="84"><span class="lineNum"> 84 </span> : */</a>
<a name="85"><span class="lineNum"> 85 </span> : #if !defined(tommy_malloc) || !defined(tommy_calloc) || !defined(tommy_realloc) || !defined(tommy_free)</a>
<a name="86"><span class="lineNum"> 86 </span> : #include &lt;stdlib.h&gt;</a>
<a name="87"><span class="lineNum"> 87 </span> : #endif</a>
<a name="88"><span class="lineNum"> 88 </span> : #if !defined(tommy_malloc)</a>
<a name="89"><span class="lineNum"> 89 </span> : #define tommy_malloc malloc</a>
<a name="90"><span class="lineNum"> 90 </span> : #endif</a>
<a name="91"><span class="lineNum"> 91 </span> : #if !defined(tommy_calloc)</a>
<a name="92"><span class="lineNum"> 92 </span> : #define tommy_calloc calloc</a>
<a name="93"><span class="lineNum"> 93 </span> : #endif</a>
<a name="94"><span class="lineNum"> 94 </span> : #if !defined(tommy_realloc)</a>
<a name="95"><span class="lineNum"> 95 </span> : #define tommy_realloc realloc</a>
<a name="96"><span class="lineNum"> 96 </span> : #endif</a>
<a name="97"><span class="lineNum"> 97 </span> : #if !defined(tommy_free)</a>
<a name="98"><span class="lineNum"> 98 </span> : #define tommy_free free</a>
<a name="99"><span class="lineNum"> 99 </span> : #endif</a>
<a name="100"><span class="lineNum"> 100 </span> : </a>
<a name="101"><span class="lineNum"> 101 </span> : /******************************************************************************/</a>
<a name="102"><span class="lineNum"> 102 </span> : /* modificators */</a>
<a name="103"><span class="lineNum"> 103 </span> : </a>
<a name="104"><span class="lineNum"> 104 </span> : /** \internal</a>
<a name="105"><span class="lineNum"> 105 </span> : * Definition of TOMMY_API.</a>
<a name="106"><span class="lineNum"> 106 </span> : * Provide the ability to override linkage features of the interface.</a>
<a name="107"><span class="lineNum"> 107 </span> : */</a>
<a name="108"><span class="lineNum"> 108 </span> : #if !defined(TOMMY_API)</a>
<a name="109"><span class="lineNum"> 109 </span> : #define TOMMY_API</a>
<a name="110"><span class="lineNum"> 110 </span> : #endif</a>
<a name="111"><span class="lineNum"> 111 </span> : </a>
<a name="112"><span class="lineNum"> 112 </span> : /** \internal</a>
<a name="113"><span class="lineNum"> 113 </span> : * Definition of the inline keyword if available.</a>
<a name="114"><span class="lineNum"> 114 </span> : */</a>
<a name="115"><span class="lineNum"> 115 </span> : #if !defined(tommy_inline)</a>
<a name="116"><span class="lineNum"> 116 </span> : #if defined(_MSC_VER) || defined(__GNUC__)</a>
<a name="117"><span class="lineNum"> 117 </span> : #define tommy_inline static __inline</a>
<a name="118"><span class="lineNum"> 118 </span> : #else</a>
<a name="119"><span class="lineNum"> 119 </span> : #define tommy_inline static</a>
2026-02-28 09:59:35 +01:00
<a name="120"><span class="lineNum"> 120 </span> : #endif</a>
2026-04-29 15:08:50 +02:00
<a name="121"><span class="lineNum"> 121 </span> : #endif</a>
<a name="122"><span class="lineNum"> 122 </span> : </a>
<a name="123"><span class="lineNum"> 123 </span> : /** \internal</a>
<a name="124"><span class="lineNum"> 124 </span> : * Definition of the restrict keyword if available.</a>
<a name="125"><span class="lineNum"> 125 </span> : */</a>
<a name="126"><span class="lineNum"> 126 </span> : #if !defined(tommy_restrict)</a>
<a name="127"><span class="lineNum"> 127 </span> : #if __STDC_VERSION__ &gt;= 199901L</a>
<a name="128"><span class="lineNum"> 128 </span> : #define tommy_restrict restrict</a>
<a name="129"><span class="lineNum"> 129 </span> : #elif defined(_MSC_VER) || defined(__GNUC__)</a>
<a name="130"><span class="lineNum"> 130 </span> : #define tommy_restrict __restrict</a>
<a name="131"><span class="lineNum"> 131 </span> : #else</a>
<a name="132"><span class="lineNum"> 132 </span> : #define tommy_restrict</a>
<a name="133"><span class="lineNum"> 133 </span> : #endif</a>
2026-02-28 09:59:35 +01:00
<a name="134"><span class="lineNum"> 134 </span> : #endif</a>
<a name="135"><span class="lineNum"> 135 </span> : </a>
<a name="136"><span class="lineNum"> 136 </span> : /** \internal</a>
2026-04-29 15:08:50 +02:00
<a name="137"><span class="lineNum"> 137 </span> : * Hints the compiler that a condition is likely true.</a>
2026-02-28 09:59:35 +01:00
<a name="138"><span class="lineNum"> 138 </span> : */</a>
2026-04-29 15:08:50 +02:00
<a name="139"><span class="lineNum"> 139 </span> : #if !defined(tommy_likely)</a>
<a name="140"><span class="lineNum"> 140 </span> : #if defined(__GNUC__)</a>
<a name="141"><span class="lineNum"> 141 </span> : #define tommy_likely(x) __builtin_expect(!!(x), 1)</a>
2026-02-28 09:59:35 +01:00
<a name="142"><span class="lineNum"> 142 </span> : #else</a>
2026-04-29 15:08:50 +02:00
<a name="143"><span class="lineNum"> 143 </span> : #define tommy_likely(x) (x)</a>
2026-02-28 09:59:35 +01:00
<a name="144"><span class="lineNum"> 144 </span> : #endif</a>
<a name="145"><span class="lineNum"> 145 </span> : #endif</a>
<a name="146"><span class="lineNum"> 146 </span> : </a>
<a name="147"><span class="lineNum"> 147 </span> : /** \internal</a>
2026-04-29 15:08:50 +02:00
<a name="148"><span class="lineNum"> 148 </span> : * Hints the compiler that a condition is likely false.</a>
2026-02-28 09:59:35 +01:00
<a name="149"><span class="lineNum"> 149 </span> : */</a>
2026-04-29 15:08:50 +02:00
<a name="150"><span class="lineNum"> 150 </span> : #if !defined(tommy_unlikely)</a>
<a name="151"><span class="lineNum"> 151 </span> : #if defined(__GNUC__)</a>
<a name="152"><span class="lineNum"> 152 </span> : #define tommy_unlikely(x) __builtin_expect(!!(x), 0)</a>
<a name="153"><span class="lineNum"> 153 </span> : #else</a>
<a name="154"><span class="lineNum"> 154 </span> : #define tommy_unlikely(x) (x)</a>
<a name="155"><span class="lineNum"> 155 </span> : #endif</a>
<a name="156"><span class="lineNum"> 156 </span> : #endif</a>
<a name="157"><span class="lineNum"> 157 </span> : </a>
<a name="158"><span class="lineNum"> 158 </span> : /******************************************************************************/</a>
<a name="159"><span class="lineNum"> 159 </span> : /* key/hash */</a>
<a name="160"><span class="lineNum"> 160 </span> : </a>
<a name="161"><span class="lineNum"> 161 </span> : /**</a>
<a name="162"><span class="lineNum"> 162 </span> : * Type used in indexed data structures to store the key of an object.</a>
<a name="163"><span class="lineNum"> 163 </span> : */</a>
<a name="164"><span class="lineNum"> 164 </span> : typedef tommy_size_t tommy_key_t;</a>
<a name="165"><span class="lineNum"> 165 </span> : </a>
<a name="166"><span class="lineNum"> 166 </span> : /**</a>
<a name="167"><span class="lineNum"> 167 </span> : * Type used in hashtables to store the hash of an object.</a>
<a name="168"><span class="lineNum"> 168 </span> : */</a>
<a name="169"><span class="lineNum"> 169 </span> : typedef tommy_size_t tommy_hash_t;</a>
2026-02-28 09:59:35 +01:00
<a name="170"><span class="lineNum"> 170 </span> : </a>
2026-04-29 15:08:50 +02:00
<a name="171"><span class="lineNum"> 171 </span> : /******************************************************************************/</a>
<a name="172"><span class="lineNum"> 172 </span> : /* node */</a>
<a name="173"><span class="lineNum"> 173 </span> : </a>
<a name="174"><span class="lineNum"> 174 </span> : /**</a>
<a name="175"><span class="lineNum"> 175 </span> : * Data structure node.</a>
<a name="176"><span class="lineNum"> 176 </span> : * This node type is shared between all the data structures and used to store some</a>
<a name="177"><span class="lineNum"> 177 </span> : * info directly into the objects you want to store.</a>
<a name="178"><span class="lineNum"> 178 </span> : *</a>
<a name="179"><span class="lineNum"> 179 </span> : * A typical declaration is:</a>
<a name="180"><span class="lineNum"> 180 </span> : * \code</a>
<a name="181"><span class="lineNum"> 181 </span> : * struct object {</a>
<a name="182"><span class="lineNum"> 182 </span> : * tommy_node node;</a>
<a name="183"><span class="lineNum"> 183 </span> : * // other fields</a>
<a name="184"><span class="lineNum"> 184 </span> : * };</a>
<a name="185"><span class="lineNum"> 185 </span> : * \endcode</a>
<a name="186"><span class="lineNum"> 186 </span> : */</a>
<a name="187"><span class="lineNum"> 187 </span> : typedef struct tommy_node_struct {</a>
<a name="188"><span class="lineNum"> 188 </span> : /**</a>
<a name="189"><span class="lineNum"> 189 </span> : * Next node.</a>
<a name="190"><span class="lineNum"> 190 </span> : * The tail node has it at 0, like a 0 terminated list.</a>
<a name="191"><span class="lineNum"> 191 </span> : */</a>
<a name="192"><span class="lineNum"> 192 </span> : struct tommy_node_struct* next;</a>
<a name="193"><span class="lineNum"> 193 </span> : </a>
<a name="194"><span class="lineNum"> 194 </span> : /**</a>
<a name="195"><span class="lineNum"> 195 </span> : * Previous node.</a>
<a name="196"><span class="lineNum"> 196 </span> : * The head node points to the tail node, like a circular list.</a>
<a name="197"><span class="lineNum"> 197 </span> : */</a>
<a name="198"><span class="lineNum"> 198 </span> : struct tommy_node_struct* prev;</a>
<a name="199"><span class="lineNum"> 199 </span> : </a>
<a name="200"><span class="lineNum"> 200 </span> : /**</a>
<a name="201"><span class="lineNum"> 201 </span> : * Pointer to the object containing the node.</a>
<a name="202"><span class="lineNum"> 202 </span> : * This field is initialized when inserting nodes into a data structure.</a>
<a name="203"><span class="lineNum"> 203 </span> : */</a>
<a name="204"><span class="lineNum"> 204 </span> : void* data;</a>
<a name="205"><span class="lineNum"> 205 </span> : </a>
<a name="206"><span class="lineNum"> 206 </span> : /**</a>
<a name="207"><span class="lineNum"> 207 </span> : * Index of the node.</a>
<a name="208"><span class="lineNum"> 208 </span> : * With tries this field is used to store the key.</a>
<a name="209"><span class="lineNum"> 209 </span> : * With hashtables this field is used to store the hash value.</a>
<a name="210"><span class="lineNum"> 210 </span> : * With lists this field is not used.</a>
<a name="211"><span class="lineNum"> 211 </span> : */</a>
<a name="212"><span class="lineNum"> 212 </span> : tommy_size_t index;</a>
<a name="213"><span class="lineNum"> 213 </span> : } tommy_node;</a>
<a name="214"><span class="lineNum"> 214 </span> : </a>
<a name="215"><span class="lineNum"> 215 </span> : /******************************************************************************/</a>
<a name="216"><span class="lineNum"> 216 </span> : /* compare */</a>
2026-02-28 09:59:35 +01:00
<a name="217"><span class="lineNum"> 217 </span> : </a>
2026-04-29 15:08:50 +02:00
<a name="218"><span class="lineNum"> 218 </span> : /**</a>
<a name="219"><span class="lineNum"> 219 </span> : * Compare function for elements.</a>
<a name="220"><span class="lineNum"> 220 </span> : * \param obj_a Pointer to the first object to compare.</a>
<a name="221"><span class="lineNum"> 221 </span> : * \param obj_b Pointer to the second object to compare.</a>
<a name="222"><span class="lineNum"> 222 </span> : * \return &lt;0 if the first element is less than the second, ==0 if equal, &gt;0 if greater.</a>
<a name="223"><span class="lineNum"> 223 </span> : *</a>
<a name="224"><span class="lineNum"> 224 </span> : * This function is like the C strcmp().</a>
<a name="225"><span class="lineNum"> 225 </span> : *</a>
<a name="226"><span class="lineNum"> 226 </span> : * \code</a>
<a name="227"><span class="lineNum"> 227 </span> : * struct object {</a>
<a name="228"><span class="lineNum"> 228 </span> : * tommy_node node;</a>
<a name="229"><span class="lineNum"> 229 </span> : * int value;</a>
<a name="230"><span class="lineNum"> 230 </span> : * };</a>
<a name="231"><span class="lineNum"> 231 </span> : *</a>
<a name="232"><span class="lineNum"> 232 </span> : * int compare(const void* obj_a, const void* obj_b)</a>
<a name="233"><span class="lineNum"> 233 </span> : * {</a>
<a name="234"><span class="lineNum"> 234 </span> : * if (((const struct object*)obj_a)-&gt;value &lt; ((const struct object*)obj_b)-&gt;value)</a>
<a name="235"><span class="lineNum"> 235 </span> : * return -1;</a>
<a name="236"><span class="lineNum"> 236 </span> : * if (((const struct object*)obj_a)-&gt;value &gt; ((const struct object*)obj_b)-&gt;value)</a>
<a name="237"><span class="lineNum"> 237 </span> : * return 1;</a>
<a name="238"><span class="lineNum"> 238 </span> : * return 0;</a>
<a name="239"><span class="lineNum"> 239 </span> : * }</a>
<a name="240"><span class="lineNum"> 240 </span> : *</a>
<a name="241"><span class="lineNum"> 241 </span> : * tommy_list_sort(&amp;list, compare);</a>
<a name="242"><span class="lineNum"> 242 </span> : * \endcode</a>
<a name="243"><span class="lineNum"> 243 </span> : *</a>
<a name="244"><span class="lineNum"> 244 </span> : */</a>
<a name="245"><span class="lineNum"> 245 </span> : typedef int tommy_compare_func(const void* obj_a, const void* obj_b);</a>
<a name="246"><span class="lineNum"> 246 </span> : </a>
<a name="247"><span class="lineNum"> 247 </span> : /**</a>
<a name="248"><span class="lineNum"> 248 </span> : * Search function for elements.</a>
<a name="249"><span class="lineNum"> 249 </span> : * \param arg Pointer to the value to search as passed at the search function.</a>
<a name="250"><span class="lineNum"> 250 </span> : * \param obj Pointer to the object to compare to.</a>
<a name="251"><span class="lineNum"> 251 </span> : * \return ==0 if the value matches the element. !=0 if different.</a>
<a name="252"><span class="lineNum"> 252 </span> : *</a>
<a name="253"><span class="lineNum"> 253 </span> : * The first argument is a pointer to the value to search exactly</a>
<a name="254"><span class="lineNum"> 254 </span> : * as it's passed at the search function called.</a>
<a name="255"><span class="lineNum"> 255 </span> : * The second argument is a pointer to the object inside the hashtable to compare.</a>
<a name="256"><span class="lineNum"> 256 </span> : *</a>
<a name="257"><span class="lineNum"> 257 </span> : * The return value has to be 0 if the values are equal. != 0 if they are different.</a>
<a name="258"><span class="lineNum"> 258 </span> : *</a>
<a name="259"><span class="lineNum"> 259 </span> : * \code</a>
<a name="260"><span class="lineNum"> 260 </span> : * struct object {</a>
<a name="261"><span class="lineNum"> 261 </span> : * tommy_node node;</a>
<a name="262"><span class="lineNum"> 262 </span> : * int value;</a>
<a name="263"><span class="lineNum"> 263 </span> : * };</a>
2025-10-28 12:01:21 +01:00
<a name="264"><span class="lineNum"> 264 </span> : *</a>
2026-04-29 15:08:50 +02:00
<a name="265"><span class="lineNum"> 265 </span> : * int compare(const void* arg, const void* obj)</a>
<a name="266"><span class="lineNum"> 266 </span> : * {</a>
<a name="267"><span class="lineNum"> 267 </span> : * const int* value_to_find = arg;</a>
<a name="268"><span class="lineNum"> 268 </span> : * const struct object* object_to_compare = obj;</a>
<a name="269"><span class="lineNum"> 269 </span> : *</a>
<a name="270"><span class="lineNum"> 270 </span> : * return *value_to_find != object_to_compare-&gt;value;</a>
<a name="271"><span class="lineNum"> 271 </span> : * }</a>
<a name="272"><span class="lineNum"> 272 </span> : *</a>
<a name="273"><span class="lineNum"> 273 </span> : * int value_to_find = 1;</a>
<a name="274"><span class="lineNum"> 274 </span> : * struct object* obj = tommy_hashtable_search(&amp;hashtable, compare, &amp;value_to_find, tommy_inthash_u32(value_to_find));</a>
<a name="275"><span class="lineNum"> 275 </span> : * if (!obj) {</a>
<a name="276"><span class="lineNum"> 276 </span> : * // not found</a>
<a name="277"><span class="lineNum"> 277 </span> : * } else {</a>
<a name="278"><span class="lineNum"> 278 </span> : * // found</a>
<a name="279"><span class="lineNum"> 279 </span> : * }</a>
<a name="280"><span class="lineNum"> 280 </span> : * \endcode</a>
<a name="281"><span class="lineNum"> 281 </span> : *</a>
<a name="282"><span class="lineNum"> 282 </span> : */</a>
<a name="283"><span class="lineNum"> 283 </span> : typedef int tommy_search_func(const void* arg, const void* obj);</a>
<a name="284"><span class="lineNum"> 284 </span> : </a>
<a name="285"><span class="lineNum"> 285 </span> : /**</a>
<a name="286"><span class="lineNum"> 286 </span> : * Foreach function.</a>
<a name="287"><span class="lineNum"> 287 </span> : * \param obj Pointer to the object to iterate.</a>
2026-02-28 09:59:35 +01:00
<a name="288"><span class="lineNum"> 288 </span> : *</a>
2026-04-29 15:08:50 +02:00
<a name="289"><span class="lineNum"> 289 </span> : * A typical example is to use free() to deallocate all the objects in a list.</a>
<a name="290"><span class="lineNum"> 290 </span> : * \code</a>
<a name="291"><span class="lineNum"> 291 </span> : * tommy_list_foreach(&amp;list, (tommy_foreach_func*)free);</a>
<a name="292"><span class="lineNum"> 292 </span> : * \endcode</a>
<a name="293"><span class="lineNum"> 293 </span> : */</a>
<a name="294"><span class="lineNum"> 294 </span> : typedef void tommy_foreach_func(void* obj);</a>
<a name="295"><span class="lineNum"> 295 </span> : </a>
<a name="296"><span class="lineNum"> 296 </span> : /**</a>
<a name="297"><span class="lineNum"> 297 </span> : * Foreach function with an argument.</a>
<a name="298"><span class="lineNum"> 298 </span> : * \param arg Pointer to a generic argument.</a>
<a name="299"><span class="lineNum"> 299 </span> : * \param obj Pointer to the object to iterate.</a>
<a name="300"><span class="lineNum"> 300 </span> : */</a>
<a name="301"><span class="lineNum"> 301 </span> : typedef void tommy_foreach_arg_func(void* arg, void* obj);</a>
<a name="302"><span class="lineNum"> 302 </span> : </a>
<a name="303"><span class="lineNum"> 303 </span> : /******************************************************************************/</a>
<a name="304"><span class="lineNum"> 304 </span> : /* bit hacks */</a>
<a name="305"><span class="lineNum"> 305 </span> : </a>
<a name="306"><span class="lineNum"> 306 </span> : #if defined(_MSC_VER) &amp;&amp; !defined(__cplusplus)</a>
<a name="307"><span class="lineNum"> 307 </span> : #include &lt;intrin.h&gt;</a>
<a name="308"><span class="lineNum"> 308 </span> : #pragma intrinsic(_BitScanReverse)</a>
<a name="309"><span class="lineNum"> 309 </span> : #pragma intrinsic(_BitScanForward)</a>
<a name="310"><span class="lineNum"> 310 </span> : #if TOMMY_SIZE_BIT == 64</a>
<a name="311"><span class="lineNum"> 311 </span> : #pragma intrinsic(_BitScanReverse64)</a>
<a name="312"><span class="lineNum"> 312 </span> : #pragma intrinsic(_BitScanForward64)</a>
<a name="313"><span class="lineNum"> 313 </span> : #endif</a>
<a name="314"><span class="lineNum"> 314 </span> : #endif</a>
<a name="315"><span class="lineNum"> 315 </span> : </a>
<a name="316"><span class="lineNum"> 316 </span> : /** \internal</a>
<a name="317"><span class="lineNum"> 317 </span> : * Integer log2 for constants.</a>
<a name="318"><span class="lineNum"> 318 </span> : * You can use it only for exact power of 2 up to 256.</a>
<a name="319"><span class="lineNum"> 319 </span> : */</a>
<a name="320"><span class="lineNum"> 320 </span> : #define TOMMY_ILOG2(value) ((value) == 256 ? 8 : (value) == 128 ? 7 : (value) == 64 ? 6 : (value) == 32 ? 5 : (value) == 16 ? 4 : (value) == 8 ? 3 : (value) == 4 ? 2 : (value) == 2 ? 1 : 0)</a>
<a name="321"><span class="lineNum"> 321 </span> : </a>
<a name="322"><span class="lineNum"> 322 </span> : /**</a>
<a name="323"><span class="lineNum"> 323 </span> : * Bit scan reverse or integer log2.</a>
<a name="324"><span class="lineNum"> 324 </span> : * Return the bit index of the most significant 1 bit.</a>
<a name="325"><span class="lineNum"> 325 </span> : *</a>
<a name="326"><span class="lineNum"> 326 </span> : * If no bit is set, the result is undefined.</a>
<a name="327"><span class="lineNum"> 327 </span> : * To force a return 0 in this case, you can use tommy_ilog2_u32(value | 1).</a>
<a name="328"><span class="lineNum"> 328 </span> : *</a>
<a name="329"><span class="lineNum"> 329 </span> : * Other interesting ways for bitscan are at:</a>
<a name="330"><span class="lineNum"> 330 </span> : *</a>
<a name="331"><span class="lineNum"> 331 </span> : * Bit Twiddling Hacks</a>
<a name="332"><span class="lineNum"> 332 </span> : * http://graphics.stanford.edu/~seander/bithacks.html</a>
<a name="333"><span class="lineNum"> 333 </span> : *</a>
<a name="334"><span class="lineNum"> 334 </span> : * Chess Programming BitScan</a>
<a name="335"><span class="lineNum"> 335 </span> : * http://chessprogramming.wikispaces.com/BitScan</a>
<a name="336"><span class="lineNum"> 336 </span> : *</a>
<a name="337"><span class="lineNum"> 337 </span> : * \param value Value to scan. 0 is not allowed.</a>
<a name="338"><span class="lineNum"> 338 </span> : * \return The index of the most significant bit set.</a>
<a name="339"><span class="lineNum"> 339 </span> : */</a>
<a name="340"><span class="lineNum"> 340 </span> : tommy_inline tommy_uint_t tommy_ilog2_u32(tommy_uint32_t value)</a>
<a name="341"><span class="lineNum"> 341 </span> : {</a>
<a name="342"><span class="lineNum"> 342 </span> : #if defined(_MSC_VER)</a>
<a name="343"><span class="lineNum"> 343 </span> : unsigned long count;</a>
<a name="344"><span class="lineNum"> 344 </span> : _BitScanReverse(&amp;count, value);</a>
<a name="345"><span class="lineNum"> 345 </span> : return count;</a>
<a name="346"><span class="lineNum"> 346 </span> : #elif defined(__GNUC__)</a>
<a name="347"><span class="lineNum"> 347 </span> : /*</a>
<a name="348"><span class="lineNum"> 348 </span> : * GCC implements __builtin_clz(x) as &quot;__builtin_clz(x) = bsr(x) ^ 31&quot;</a>
<a name="349"><span class="lineNum"> 349 </span> : *</a>
<a name="350"><span class="lineNum"> 350 </span> : * Where &quot;x ^ 31 = 31 - x&quot;, but gcc does not optimize &quot;31 - __builtin_clz(x)&quot; to bsr(x),</a>
<a name="351"><span class="lineNum"> 351 </span> : * but generates 31 - (bsr(x) xor 31).</a>
<a name="352"><span class="lineNum"> 352 </span> : *</a>
<a name="353"><span class="lineNum"> 353 </span> : * So we write &quot;__builtin_clz(x) ^ 31&quot; instead of &quot;31 - __builtin_clz(x)&quot;,</a>
<a name="354"><span class="lineNum"> 354 </span> : * to allow the double xor to be optimized out.</a>
<a name="355"><span class="lineNum"> 355 </span> : */</a>
<a name="356"><span class="lineNum"> 356 </span> : return __builtin_clz(value) ^ 31;</a>
<a name="357"><span class="lineNum"> 357 </span> : #else</a>
<a name="358"><span class="lineNum"> 358 </span> : /* Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup */</a>
<a name="359"><span class="lineNum"> 359 </span> : /* from http://graphics.stanford.edu/~seander/bithacks.html */</a>
<a name="360"><span class="lineNum"> 360 </span> : static unsigned char TOMMY_DE_BRUIJN_INDEX_ILOG2[32] = {</a>
<a name="361"><span class="lineNum"> 361 </span> : 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30,</a>
<a name="362"><span class="lineNum"> 362 </span> : 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31</a>
<a name="363"><span class="lineNum"> 363 </span> : };</a>
<a name="364"><span class="lineNum"> 364 </span> : </a>
<a name="365"><span class="lineNum"> 365 </span> : value |= value &gt;&gt; 1;</a>
<a name="366"><span class="lineNum"> 366 </span> : value |= value &gt;&gt; 2;</a>
<a name="367"><span class="lineNum"> 367 </span> : value |= value &gt;&gt; 4;</a>
<a name="368"><span class="lineNum"> 368 </span> : value |= value &gt;&gt; 8;</a>
<a name="369"><span class="lineNum"> 369 </span> : value |= value &gt;&gt; 16;</a>
<a name="370"><span class="lineNum"> 370 </span> : </a>
<a name="371"><span class="lineNum"> 371 </span> : return TOMMY_DE_BRUIJN_INDEX_ILOG2[(tommy_uint32_t)(value * 0x07C4ACDDU) &gt;&gt; 27];</a>
<a name="372"><span class="lineNum"> 372 </span> : #endif</a>
<a name="373"><span class="lineNum"> 373 </span> : }</a>
<a name="374"><span class="lineNum"> 374 </span> : </a>
<a name="375"><span class="lineNum"> 375 </span> : #if TOMMY_SIZE_BIT == 64</a>
<a name="376"><span class="lineNum"> 376 </span> : /**</a>
<a name="377"><span class="lineNum"> 377 </span> : * Bit scan reverse or integer log2 for 64 bits.</a>
<a name="378"><span class="lineNum"> 378 </span> : */</a>
<a name="379"><span class="lineNum"> 379 </span><span class="lineCov"> 8946200 : tommy_inline tommy_uint_t tommy_ilog2_u64(tommy_uint64_t value)</span></a>
<a name="380"><span class="lineNum"> 380 </span> : {</a>
<a name="381"><span class="lineNum"> 381 </span> : #if defined(_MSC_VER)</a>
<a name="382"><span class="lineNum"> 382 </span> : unsigned long count;</a>
<a name="383"><span class="lineNum"> 383 </span> : _BitScanReverse64(&amp;count, value);</a>
<a name="384"><span class="lineNum"> 384 </span> : return count;</a>
<a name="385"><span class="lineNum"> 385 </span> : #elif defined(__GNUC__)</a>
<a name="386"><span class="lineNum"> 386 </span><span class="lineCov"> 8946200 : return __builtin_clzll(value) ^ 63;</span></a>
<a name="387"><span class="lineNum"> 387 </span> : #else</a>
<a name="388"><span class="lineNum"> 388 </span> : tommy_uint32_t l = value &amp; 0xFFFFFFFFU;</a>
<a name="389"><span class="lineNum"> 389 </span> : tommy_uint32_t h = value &gt;&gt; 32;</a>
<a name="390"><span class="lineNum"> 390 </span> : if (h)</a>
<a name="391"><span class="lineNum"> 391 </span> : return tommy_ilog2_u32(h) + 32;</a>
<a name="392"><span class="lineNum"> 392 </span> : else</a>
<a name="393"><span class="lineNum"> 393 </span> : return tommy_ilog2_u32(l);</a>
<a name="394"><span class="lineNum"> 394 </span> : #endif</a>
<a name="395"><span class="lineNum"> 395 </span> : }</a>
2026-02-28 09:59:35 +01:00
<a name="396"><span class="lineNum"> 396 </span> : #endif</a>
2026-04-29 15:08:50 +02:00
<a name="397"><span class="lineNum"> 397 </span> : </a>
<a name="398"><span class="lineNum"> 398 </span> : /**</a>
<a name="399"><span class="lineNum"> 399 </span> : * Bit scan forward or trailing zero count.</a>
<a name="400"><span class="lineNum"> 400 </span> : * Return the bit index of the least significant 1 bit.</a>
<a name="401"><span class="lineNum"> 401 </span> : *</a>
<a name="402"><span class="lineNum"> 402 </span> : * If no bit is set, the result is undefined.</a>
<a name="403"><span class="lineNum"> 403 </span> : * \param value Value to scan. 0 is not allowed.</a>
<a name="404"><span class="lineNum"> 404 </span> : * \return The index of the least significant bit set.</a>
<a name="405"><span class="lineNum"> 405 </span> : */</a>
<a name="406"><span class="lineNum"> 406 </span> : tommy_inline tommy_uint_t tommy_ctz_u32(tommy_uint32_t value)</a>
<a name="407"><span class="lineNum"> 407 </span> : {</a>
<a name="408"><span class="lineNum"> 408 </span> : #if defined(_MSC_VER)</a>
<a name="409"><span class="lineNum"> 409 </span> : unsigned long count;</a>
<a name="410"><span class="lineNum"> 410 </span> : _BitScanForward(&amp;count, value);</a>
<a name="411"><span class="lineNum"> 411 </span> : return count;</a>
<a name="412"><span class="lineNum"> 412 </span> : #elif defined(__GNUC__)</a>
<a name="413"><span class="lineNum"> 413 </span> : return __builtin_ctz(value);</a>
<a name="414"><span class="lineNum"> 414 </span> : #else</a>
<a name="415"><span class="lineNum"> 415 </span> : /* Count the consecutive zero bits (trailing) on the right with multiply and lookup */</a>
<a name="416"><span class="lineNum"> 416 </span> : /* from http://graphics.stanford.edu/~seander/bithacks.html */</a>
<a name="417"><span class="lineNum"> 417 </span> : static const unsigned char TOMMY_DE_BRUIJN_INDEX_CTZ[32] = {</a>
<a name="418"><span class="lineNum"> 418 </span> : 0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,</a>
<a name="419"><span class="lineNum"> 419 </span> : 31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9</a>
<a name="420"><span class="lineNum"> 420 </span> : };</a>
2026-02-28 09:59:35 +01:00
<a name="421"><span class="lineNum"> 421 </span> : </a>
2026-04-29 15:08:50 +02:00
<a name="422"><span class="lineNum"> 422 </span> : return TOMMY_DE_BRUIJN_INDEX_CTZ[(tommy_uint32_t)(((value &amp; - value) * 0x077CB531U)) &gt;&gt; 27];</a>
<a name="423"><span class="lineNum"> 423 </span> : #endif</a>
<a name="424"><span class="lineNum"> 424 </span> : }</a>
<a name="425"><span class="lineNum"> 425 </span> : </a>
<a name="426"><span class="lineNum"> 426 </span> : #if TOMMY_SIZE_BIT == 64</a>
<a name="427"><span class="lineNum"> 427 </span> : /**</a>
<a name="428"><span class="lineNum"> 428 </span> : * Bit scan forward or trailing zero count for 64 bits.</a>
2026-02-28 09:59:35 +01:00
<a name="429"><span class="lineNum"> 429 </span> : */</a>
2026-04-29 15:08:50 +02:00
<a name="430"><span class="lineNum"> 430 </span><span class="lineCov"> 2427 : tommy_inline tommy_uint_t tommy_ctz_u64(tommy_uint64_t value)</span></a>
2026-02-28 09:59:35 +01:00
<a name="431"><span class="lineNum"> 431 </span> : {</a>
<a name="432"><span class="lineNum"> 432 </span> : #if defined(_MSC_VER)</a>
<a name="433"><span class="lineNum"> 433 </span> : unsigned long count;</a>
2026-04-29 15:08:50 +02:00
<a name="434"><span class="lineNum"> 434 </span> : _BitScanForward64(&amp;count, value);</a>
2026-02-28 09:59:35 +01:00
<a name="435"><span class="lineNum"> 435 </span> : return count;</a>
<a name="436"><span class="lineNum"> 436 </span> : #elif defined(__GNUC__)</a>
2026-04-29 15:08:50 +02:00
<a name="437"><span class="lineNum"> 437 </span><span class="lineCov"> 2427 : return __builtin_ctzll(value);</span></a>
2026-02-28 09:59:35 +01:00
<a name="438"><span class="lineNum"> 438 </span> : #else</a>
2026-04-29 15:08:50 +02:00
<a name="439"><span class="lineNum"> 439 </span> : tommy_uint32_t l = value &amp; 0xFFFFFFFFU;</a>
<a name="440"><span class="lineNum"> 440 </span> : tommy_uint32_t h = value &gt;&gt; 32;</a>
<a name="441"><span class="lineNum"> 441 </span> : if (l)</a>
<a name="442"><span class="lineNum"> 442 </span> : return tommy_ctz_u32(l);</a>
<a name="443"><span class="lineNum"> 443 </span> : else</a>
<a name="444"><span class="lineNum"> 444 </span> : return tommy_ctz_u32(h) + 32;</a>
<a name="445"><span class="lineNum"> 445 </span> : #endif</a>
<a name="446"><span class="lineNum"> 446 </span> : }</a>
2026-02-28 09:59:35 +01:00
<a name="447"><span class="lineNum"> 447 </span> : #endif</a>
2026-04-29 15:08:50 +02:00
<a name="448"><span class="lineNum"> 448 </span> : </a>
<a name="449"><span class="lineNum"> 449 </span> : /**</a>
<a name="450"><span class="lineNum"> 450 </span> : * Rounds up to the next power of 2.</a>
<a name="451"><span class="lineNum"> 451 </span> : * For the value 0, the result is undefined.</a>
<a name="452"><span class="lineNum"> 452 </span> : * \return The smallest power of 2 not less than the specified value.</a>
2026-02-28 09:59:35 +01:00
<a name="453"><span class="lineNum"> 453 </span> : */</a>
2026-04-29 15:08:50 +02:00
<a name="454"><span class="lineNum"> 454 </span> : tommy_inline tommy_uint32_t tommy_roundup_pow2_u32(tommy_uint32_t value)</a>
2026-02-28 09:59:35 +01:00
<a name="455"><span class="lineNum"> 455 </span> : {</a>
2026-04-29 15:08:50 +02:00
<a name="456"><span class="lineNum"> 456 </span> : /* Round up to the next highest power of 2 */</a>
<a name="457"><span class="lineNum"> 457 </span> : /* from http://graphics.stanford.edu/~seander/bithacks.html */</a>
<a name="458"><span class="lineNum"> 458 </span> : </a>
<a name="459"><span class="lineNum"> 459 </span> : --value;</a>
<a name="460"><span class="lineNum"> 460 </span> : value |= value &gt;&gt; 1;</a>
<a name="461"><span class="lineNum"> 461 </span> : value |= value &gt;&gt; 2;</a>
<a name="462"><span class="lineNum"> 462 </span> : value |= value &gt;&gt; 4;</a>
<a name="463"><span class="lineNum"> 463 </span> : value |= value &gt;&gt; 8;</a>
<a name="464"><span class="lineNum"> 464 </span> : value |= value &gt;&gt; 16;</a>
<a name="465"><span class="lineNum"> 465 </span> : ++value;</a>
<a name="466"><span class="lineNum"> 466 </span> : </a>
<a name="467"><span class="lineNum"> 467 </span> : return value;</a>
<a name="468"><span class="lineNum"> 468 </span> : }</a>
<a name="469"><span class="lineNum"> 469 </span> : </a>
<a name="470"><span class="lineNum"> 470 </span> : /**</a>
<a name="471"><span class="lineNum"> 471 </span> : * Rounds up to the next power of 2 for 64 bits.</a>
<a name="472"><span class="lineNum"> 472 </span> : */</a>
<a name="473"><span class="lineNum"> 473 </span> : tommy_inline tommy_uint64_t tommy_roundup_pow2_u64(tommy_uint64_t value)</a>
<a name="474"><span class="lineNum"> 474 </span> : {</a>
<a name="475"><span class="lineNum"> 475 </span> : --value;</a>
<a name="476"><span class="lineNum"> 476 </span> : value |= value &gt;&gt; 1;</a>
<a name="477"><span class="lineNum"> 477 </span> : value |= value &gt;&gt; 2;</a>
<a name="478"><span class="lineNum"> 478 </span> : value |= value &gt;&gt; 4;</a>
<a name="479"><span class="lineNum"> 479 </span> : value |= value &gt;&gt; 8;</a>
<a name="480"><span class="lineNum"> 480 </span> : value |= value &gt;&gt; 16;</a>
<a name="481"><span class="lineNum"> 481 </span> : value |= value &gt;&gt; 32;</a>
<a name="482"><span class="lineNum"> 482 </span> : ++value;</a>
<a name="483"><span class="lineNum"> 483 </span> : </a>
<a name="484"><span class="lineNum"> 484 </span> : return value;</a>
<a name="485"><span class="lineNum"> 485 </span> : }</a>
<a name="486"><span class="lineNum"> 486 </span> : </a>
<a name="487"><span class="lineNum"> 487 </span> : /**</a>
<a name="488"><span class="lineNum"> 488 </span> : * Check if the specified word has a byte at 0.</a>
<a name="489"><span class="lineNum"> 489 </span> : * \return 0 or 1.</a>
<a name="490"><span class="lineNum"> 490 </span> : */</a>
<a name="491"><span class="lineNum"> 491 </span><span class="lineCov"> 200862 : tommy_inline int tommy_haszero_u32(tommy_uint32_t value)</span></a>
<a name="492"><span class="lineNum"> 492 </span> : {</a>
<a name="493"><span class="lineNum"> 493 </span><span class="lineCov"> 200862 : return ((value - 0x01010101) &amp; ~value &amp; 0x80808080) != 0;</span></a>
<a name="494"><span class="lineNum"> 494 </span> : }</a>
<a name="495"><span class="lineNum"> 495 </span> : </a>
<a name="496"><span class="lineNum"> 496 </span> : /*</a>
<a name="497"><span class="lineNum"> 497 </span> : * Bit depth mapping.</a>
<a name="498"><span class="lineNum"> 498 </span> : */</a>
<a name="499"><span class="lineNum"> 499 </span> : #if TOMMY_SIZE_BIT == 64</a>
<a name="500"><span class="lineNum"> 500 </span> : #define tommy_ilog2 tommy_ilog2_u64</a>
<a name="501"><span class="lineNum"> 501 </span> : #define tommy_ctz tommy_ctz_u64</a>
<a name="502"><span class="lineNum"> 502 </span> : #define tommy_roundup_pow2 tommy_roundup_pow2_u64</a>
<a name="503"><span class="lineNum"> 503 </span> : #else</a>
<a name="504"><span class="lineNum"> 504 </span> : #define tommy_ilog2 tommy_ilog2_u32</a>
<a name="505"><span class="lineNum"> 505 </span> : #define tommy_ctz tommy_ctz_u32</a>
<a name="506"><span class="lineNum"> 506 </span> : #define tommy_roundup_pow2 tommy_roundup_pow2_u32</a>
<a name="507"><span class="lineNum"> 507 </span> : #endif</a>
<a name="508"><span class="lineNum"> 508 </span> : </a>
<a name="509"><span class="lineNum"> 509 </span> : #endif</a>
2011-03-01 22:19:30 +01:00
</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>
2025-10-28 12:01:21 +01:00
<tr><td class="versionInfo">Generated by: <a href="https://github.com/linux-test-project/lcov" target="_parent">LCOV version 1.0</a></td></tr>
2011-03-01 22:19:30 +01:00
</table>
<br>
</body>
</html>