item 39 bsp/drv/lib/queue.c enqueue(queue_t head, queue_t item) item 41 bsp/drv/lib/queue.c item->next = head; item 42 bsp/drv/lib/queue.c item->prev = head->prev; item 43 bsp/drv/lib/queue.c item->prev->next = item; item 44 bsp/drv/lib/queue.c head->prev = item; item 53 bsp/drv/lib/queue.c queue_t item; item 57 bsp/drv/lib/queue.c item = head->next; item 58 bsp/drv/lib/queue.c item->next->prev = head; item 59 bsp/drv/lib/queue.c head->next = item->next; item 60 bsp/drv/lib/queue.c return item; item 67 bsp/drv/lib/queue.c queue_insert(queue_t prev, queue_t item) item 69 bsp/drv/lib/queue.c item->prev = prev; item 70 bsp/drv/lib/queue.c item->next = prev->next; item 71 bsp/drv/lib/queue.c prev->next->prev = item; item 72 bsp/drv/lib/queue.c prev->next = item; item 79 bsp/drv/lib/queue.c queue_remove(queue_t item) item 81 bsp/drv/lib/queue.c item->prev->next = item->next; item 82 bsp/drv/lib/queue.c item->next->prev = item->prev; item 40 sys/lib/queue.c enqueue(queue_t head, queue_t item) item 43 sys/lib/queue.c item->next = head; item 44 sys/lib/queue.c item->prev = head->prev; item 45 sys/lib/queue.c item->prev->next = item; item 46 sys/lib/queue.c head->prev = item; item 55 sys/lib/queue.c queue_t item; item 59 sys/lib/queue.c item = head->next; item 60 sys/lib/queue.c item->next->prev = head; item 61 sys/lib/queue.c head->next = item->next; item 62 sys/lib/queue.c return item; item 69 sys/lib/queue.c queue_insert(queue_t prev, queue_t item) item 72 sys/lib/queue.c item->prev = prev; item 73 sys/lib/queue.c item->next = prev->next; item 74 sys/lib/queue.c prev->next->prev = item; item 75 sys/lib/queue.c prev->next = item; item 82 sys/lib/queue.c queue_remove(queue_t item) item 85 sys/lib/queue.c item->prev->next = item->next; item 86 sys/lib/queue.c item->next->prev = item->prev;