segp = hashp->dir[segment_num];
/*
- * Pick up the first item in this bucket's chain. If chain is
- * not empty we can go back around the outer loop to search it.
- * Otherwise we have to advance to find the next nonempty bucket.
- * We try to optimize that case since searching a near-empty
- * hashtable has to iterate this loop a lot.
+ * Pick up the first item in this bucket's chain. If chain is not empty
+ * we can begin searching it. Otherwise we have to advance to find the
+ * next nonempty bucket. We try to optimize that case since searching a
+ * near-empty hashtable has to iterate this loop a lot.
*/
while ((curElem = segp[segment_ndx]) == NULL)
{