Lines Matching defs:bottom
41 apr_skiplistnode *bottom;
397 if (!sl->bottom) {
400 return sl->bottom->next;
524 /* This sets ret to the bottom-most node we are inserting */
545 sl->bottom = sl->bottomend = m;
556 /* This sets ret to the bottom-most node we are inserting */
629 p = sl->bottom;
664 /* This only frees the actual data in the bottom one */
672 /* While the row is empty and we are not on the bottom row */
682 sl->bottom = sl->bottomend = NULL;
742 * This must remove even the place holder nodes (bottom though top)
747 m = sl->bottom;
760 sl->top = sl->bottom = NULL;
840 if(sl2->bottom == NULL || sl2->bottom->next == NULL) {