Lines Matching refs:cursor
132 q->cursor = q->head; in Q_Init()
156 return(q && q->cursor == q->head); in Q_AtHead()
176 return(q && q->cursor == q->tail); in Q_AtTail()
238 q->cursor = q->head; in Q_Head()
240 return q->cursor->data; in Q_Head()
263 q->cursor = q->tail; in Q_Tail()
265 return q->cursor->data; in Q_Tail()
310 q->cursor = q->head; in Q_PushHead()
360 q->cursor = q->tail; in Q_PushTail()
402 q->head = q->tail = q->cursor = NULL; in Q_PopHead()
406 q->cursor = q->head; in Q_PopHead()
444 q->head = q->tail = q->cursor = NULL; in Q_PopTail()
448 q->cursor = q->tail; in Q_PopTail()
479 if(!q->cursor || q->cursor->next == NULL) in Q_Next()
482 q->cursor = (node *)q->cursor->next; in Q_Next()
484 return q->cursor->data ; in Q_Next()
509 if(q->cursor->prev == NULL) in Q_Previous()
512 q->cursor = (node *)q->cursor->prev; in Q_Previous()
514 return q->cursor->data; in Q_Previous()
544 if (q->cursor == (node*)iter) { in Q_Iter_Del()
546 q->cursor = p; in Q_Iter_Del()
548 q->cursor = n; in Q_Iter_Del()
585 return Q_Iter_Del(q, (q_iter)q->cursor); in Q_DelCur()
634 if(q->cursor == NULL) in Q_Get()
636 return q->cursor->data; in Q_Get()
658 if(q->cursor == NULL) in Q_Put()
661 q->cursor->data = data; in Q_Put()
790 queue_index = emalloc(q->size * sizeof(q->cursor->data)); in Q_Sort()
794 queue_posn_index = emalloc(q->size * sizeof(q->cursor)); in Q_Sort()
805 queue_posn_index[i] = q->cursor; in Q_Sort()
912 q->cursor = queue_posn_index[idx]; in Q_Seek()