Lines Matching defs:cur
178 FreeElem *cur, *curNext;
230 for (cur = RTListNodeGetNext(&f->Node, FreeElem, Node),
231 curNext = RT_FROM_MEMBER(cur->Node.pNext, FreeElem, Node);
232 !RTListNodeIsDummy(&pool->freeList, cur, FreeElem, Node);
233 cur = curNext,
234 curNext = RT_FROM_MEMBER((cur)->Node.pNext, FreeElem, Node) )
236 if (cur->min > last)
239 newMax = cur->max;
240 RTListNodeRemove(&cur->Node);
241 crFree(cur);