Lines Matching refs:top
52 sl->top = NULL;
155 m = sl->top;
203 if(!sl->top) {
205 sl->topend = sl->bottomend = sl->top = sl->bottom =
207 assert(sl->top);
208 sl->top->next = (struct skiplistnode *) NULL;
209 sl->top->data = (struct skiplistnode *) NULL;
210 sl->top->prev =(struct skiplistnode *) NULL;
211 sl->top->up = (struct skiplistnode *) NULL;
212 sl->top->down = (struct skiplistnode *) NULL;
213 sl->top->nextindex= (struct skiplistnode *) NULL;
214 sl->top->previndex = (struct skiplistnode *) NULL;
215 sl->top->sl = sl;
225 sl->top->up =
227 assert(sl->top->up);
228 sl->top->up->down = sl->top;
229 sl->top = sl->topend = sl->top->up;
230 sl->top->prev = sl->top->next = sl->top->nextindex =
231 sl->top->previndex = sl->top->up = NULL;
232 sl->top->data = NULL;
233 sl->top->sl = sl;
238 m = sl->top;
322 sl->top->up =
324 assert(sl->top);
325 sl->top->up->down = sl->top;
326 sl->top = sl->top->up;
327 sl->top->prev = sl->top->next = sl->top->nextindex =
328 sl->top->previndex = NULL;
329 sl->top->data = NULL;
330 sl->top->sl = sl;
344 else if (lastnode == sl->top)
345 sl->top = anode;
395 /* Take the top of the longer one (if it is sl2) and make it sl1's */
402 sl1->top = sl2->top;
406 /* move the top pointer to here if it isn't there already */
407 sl2->top = sl2->topend = b2;
408 sl2->top->up = NULL; /* If it isn't already */
451 while(sl->top && sl->top->next == NULL) {
453 p = sl->top;
454 sl->top = sl->top->down; /* Move top down one */
455 if(sl->top) sl->top->up = NULL; /* Make it think its the top */
459 if(!sl->top) sl->bottom = NULL;
484 /* This must remove even the place holder nodes (bottom though top)
499 sl->top = sl->bottom = NULL;