Lines Matching refs:top
40 apr_skiplistnode *top;
307 for (m = sl->top; m; count++) {
432 /* Skiplists (even empty) always have a top node, although this
466 m = sl->top;
482 * or the new top if the current one is also removed.
484 apr_skiplistnode *top = sl->top;
486 if (top != sl->top) {
487 m = sl->top;
538 m->down = sl->top;
541 if (sl->top) {
542 sl->top->up = m;
547 sl->top = sl->topend = tmp->prev = m;
671 while (sl->top && sl->top->next == NULL) {
673 p = sl->top;
674 sl->top = sl->top->down;/* Move top down one */
675 if (sl->top) {
676 sl->top->up = NULL; /* Make it think its the top */
681 if (!sl->top) {
742 * This must remove even the place holder nodes (bottom though top)
760 sl->top = sl->bottom = NULL;