<trclass="memdesc:structmi__heap__area__t"><tdclass="mdescLeft"> </td><tdclass="mdescRight">An area of heap space contains blocks of a single size. <ahref="group__analysis.html#structmi__heap__area__t">More...</a><br/></td></tr>
<trclass="memdesc:gadfa01e2900f0e5d515ad5506b26f6d65"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Visitor function passed to <aclass="el"href="group__analysis.html#ga70c46687dc6e9dc98b232b02646f8bed"title="Visit all areas and blocks in a heap.">mi_heap_visit_blocks()</a><ahref="#gadfa01e2900f0e5d515ad5506b26f6d65">More...</a><br/></td></tr>
<trclass="memdesc:gaa862aa8ed8d57d84cae41fc1022d71af"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Does a heap contain a pointer to a previously allocated block? <ahref="#gaa862aa8ed8d57d84cae41fc1022d71af">More...</a><br/></td></tr>
<trclass="memdesc:ga0d67c1789faaa15ff366c024fcaf6377"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Check safely if any pointer is part of a heap. <ahref="#ga0d67c1789faaa15ff366c024fcaf6377">More...</a><br/></td></tr>
<trclass="memdesc:ga628c237489c2679af84a4d0d143b3dd5"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Check safely if any pointer is part of the default heap of this thread. <ahref="#ga628c237489c2679af84a4d0d143b3dd5">More...</a><br/></td></tr>
<trclass="memdesc:ga70c46687dc6e9dc98b232b02646f8bed"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Visit all areas and blocks in a heap. <ahref="#ga70c46687dc6e9dc98b232b02646f8bed">More...</a><br/></td></tr>
<p>Visitor function passed to <aclass="el"href="group__analysis.html#ga70c46687dc6e9dc98b232b02646f8bed"title="Visit all areas and blocks in a heap.">mi_heap_visit_blocks()</a></p>
<dlclass="section return"><dt>Returns</dt><dd><em>true</em> if ok, <em>false</em> to stop visiting (i.e. break)</dd></dl>
<p>This function is always first called for every <em>area</em> with <em>block</em> as a <em>NULL</em> pointer. If <em>visit_all_blocks</em> was <em>true</em>, the function is then called for every allocated block in that area. </p>
<p>Check safely if any pointer is part of the default heap of this thread. </p>
<dlclass="params"><dt>Parameters</dt><dd>
<tableclass="params">
<tr><tdclass="paramname">p</td><td>Any pointer – not required to be previously allocated by us. </td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd><em>true</em> if <em>p</em> points to a block in default heap of this thread.</dd></dl>
<p>Note: expensive function, linear in the pages in the heap. </p><dlclass="section see"><dt>See also</dt><dd><aclass="el"href="group__analysis.html#gaa862aa8ed8d57d84cae41fc1022d71af"title="Does a heap contain a pointer to a previously allocated block?">mi_heap_contains_block()</a></dd>
<dd>
<aclass="el"href="group__heap.html#ga8db4cbb87314a989a9a187464d6b5e05"title="Get the default heap that is used for mi_malloc() et al.">mi_heap_get_default()</a></dd></dl>
<tr><tdclass="paramname">p</td><td>Any pointer – not required to be previously allocated by us. </td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd><em>true</em> if <em>p</em> points to a block in <em>heap</em>.</dd></dl>
<p>Note: expensive function, linear in the pages in the heap. </p><dlclass="section see"><dt>See also</dt><dd><aclass="el"href="group__analysis.html#gaa862aa8ed8d57d84cae41fc1022d71af"title="Does a heap contain a pointer to a previously allocated block?">mi_heap_contains_block()</a></dd>
<dd>
<aclass="el"href="group__heap.html#ga8db4cbb87314a989a9a187464d6b5e05"title="Get the default heap that is used for mi_malloc() et al.">mi_heap_get_default()</a></dd></dl>
<tr><tdclass="paramname">p</td><td>Pointer to a previously allocated block (in any heap)– cannot be some random pointer! </td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd><em>true</em> if the block pointed to by <em>p</em> is in the <em>heap</em>. </dd></dl>
<dlclass="section see"><dt>See also</dt><dd><aclass="el"href="group__analysis.html#ga0d67c1789faaa15ff366c024fcaf6377"title="Check safely if any pointer is part of a heap.">mi_heap_check_owned()</a></dd></dl>
<tr><tdclass="paramname">heap</td><td>The heap to visit. </td></tr>
<tr><tdclass="paramname">visit_all_blocks</td><td>If <em>true</em> visits all allocated blocks, otherwise <em>visitor</em> is only called for every heap area. </td></tr>
<tr><tdclass="paramname">visitor</td><td>This function is called for every area in the heap (with <em>block</em> as <em>NULL</em>). If <em>visit_all_blocks</em> is <em>true</em>, <em>visitor</em> is also called for every allocated block in every area (with <code>block!=NULL</code>). return <em>false</em> from this function to stop visiting early. </td></tr>
<tr><tdclass="paramname">arg</td><td>Extra argument passed to <em>visitor</em>. </td></tr>
</table>
</dd>
</dl>
<dlclass="section return"><dt>Returns</dt><dd><em>true</em> if all areas and blocks were visited. </dd></dl>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<divid="nav-path"class="navpath"><!-- id is needed for treeview function! -->
