Lines Matching refs:ptr
64 lnode *ptr = (lnode*)rtl_allocateMemory(sizeof(lnode)); in newNode() local
65 assert(ptr != 0); in newNode()
67 ptr->value = el; in newNode()
69 return ptr; in newNode()
74 lnode *ptr = newNode(el); in appendPrim() local
83 … pThis->cptr = ptr; /*- list was empty - set current to pThis element */ in appendPrim()
86 *flink = ptr; in appendPrim()
87 pThis->tail = ptr; in appendPrim()
89 ptr->prev = blink; in appendPrim()
90 ptr->next = 0; in appendPrim()
93 return ptr; in appendPrim()
98 lnode *ptr = newNode(el); in prependPrim() local
107 … pThis->cptr = ptr; /*- list was empty - set current to pThis element */ in prependPrim()
110 *blink = ptr; in prependPrim()
111 pThis->head = ptr; in prependPrim()
113 ptr->next = flink; in prependPrim()
114 ptr->prev = 0; in prependPrim()
117 return ptr; in prependPrim()
137 lnode *ptr, *c; in listNewCopy() local
144 ptr = l->head; in listNewCopy()
150 while (ptr) { in listNewCopy()
151 c = appendPrim(pThis, ptr->value); in listNewCopy()
152 if (ptr == l->cptr) pThis->cptr = c; in listNewCopy()
153 ptr = ptr->next; in listNewCopy()
210 lnode *ptr; in listPosition() local
213 ptr = pThis->head; in listPosition()
215 while (ptr != pThis->cptr) { in listPosition()
216 ptr = ptr->next; in listPosition()
225 lnode *ptr; in listFind() local
228 ptr = pThis->head; in listFind()
230 while (ptr) { in listFind()
231 if (ptr->value == el) { in listFind()
232 pThis->cptr = ptr; in listFind()
235 ptr = ptr->next; in listFind()
317 lnode *ptr; in listInsertAfter() local
322 ptr = newNode(el); in listInsertAfter()
324 ptr->prev = pThis->cptr; in listInsertAfter()
325 ptr->next = pThis->cptr->next; in listInsertAfter()
326 pThis->cptr->next = ptr; in listInsertAfter()
328 if (ptr->next != 0) { in listInsertAfter()
329 ptr->next->prev = ptr; in listInsertAfter()
331 pThis->tail = ptr; in listInsertAfter()
339 lnode *ptr; in listInsertBefore() local
344 ptr = newNode(el); in listInsertBefore()
346 ptr->prev = pThis->cptr->prev; in listInsertBefore()
347 ptr->next = pThis->cptr; in listInsertBefore()
348 pThis->cptr->prev = ptr; in listInsertBefore()
350 if (ptr->prev != 0) { in listInsertBefore()
351 ptr->prev->next = ptr; in listInsertBefore()
353 pThis->head = ptr; in listInsertBefore()
361 lnode *ptr = 0; in listRemove() local
365 ptr = pThis->cptr->next; in listRemove()
372 if (ptr == 0) ptr = pThis->cptr->prev; in listRemove()
382 pThis->cptr = ptr; in listRemove()
388 lnode *node = pThis->head, *ptr; in listClear() local
391 ptr = node->next; in listClear()
395 node = ptr; in listClear()
407 lnode *ptr = pThis->head; in listForAll() local
408 while (ptr) { in listForAll()
409 f(ptr->value); in listForAll()
410 ptr = ptr->next; in listForAll()
468 void edtor(void *ptr) in edtor() argument
470 printf("element dtor: 0x%08x\n", ptr); in edtor()
471 rtl_freeMemory(ptr); in edtor()
477 char *ptr; in main() local
508 ptr = rtl_allocateMemory(20); in main()
509 snprintf(ptr, 20, "element # %d", i); in main()
510 listAppend(l1, ptr); in main()