eturns 1 when there are more entries
left to visit and 0 when all entries have been visited. This is
commonly used in the test of a while loop.</p>
</dd>
<dt class="hdlist1"><code>tree_entry_len</code></dt>
<dd>
<p>Calculate the length of a tree entry&#8217;s pathname. This utilizes the
memory structure of a tree entry to avoid the overhead of using a
generic strlen().</p>
</dd>
<dt class="hdlist1"><code>update_tree_entry</code></dt>
<dd>
<p>Walk to the next entry in a tree. This is commonly used in conjunc