82     struct SimpleQueueEntry *cur;  in simpleQueueDestroy()  local
85     for (i = sq->head; i != SIMPLE_QUEUE_IDX_NONE; i = cur->nextIdx) {  in simpleQueueDestroy()
86         cur = simpleQueueGetNth(sq, i);  in simpleQueueDestroy()
87         discard(cur->data, true);  in simpleQueueDestroy()
119     struct SimpleQueueEntry* cur = NULL;  in simpleQueueAllocWithDiscard()  local
122     for (idx = sq->head; idx != SIMPLE_QUEUE_IDX_NONE; prev=idx, idx = cur->nextIdx) {  in simpleQueueAllocWithDiscard()
123         cur = simpleQueueGetNth(sq, idx);  in simpleQueueAllocWithDiscard()
125         if (!cur->discardable)  in simpleQueueAllocWithDiscard()
129         if (sq->discardCbk(cur->data, false)) {  in simpleQueueAllocWithDiscard()
133                 sq->head = cur->nextIdx;  in simpleQueueAllocWithDiscard()
135                 simpleQueueGetNth(sq, prev)->nextIdx = cur->nextIdx;  in simpleQueueAllocWithDiscard()
139             return cur;  in simpleQueueAllocWithDiscard()