Searched refs:head (Results 1 – 13 of 13) sorted by relevance
46 node* head; variable52 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {} in Map()53 bool empty() const { return ( !head || !tail ); } in empty()66 while(head) in ~Map()68 node* temp(head); in ~Map()69 head=head->next; in ~Map()79 tmp = head; in find()94 tmp = head; in find_ele()109 tmp = head; in begin()120 tmp = head; in show()[all …]
45 Node *head; member55 q->head = q->tail = NULL; in alloc_queue()91 q->head = new_node; in push()112 temp = q->head; in pop()117 q->head = q->tail = NULL; in pop()121 q->head = q->head->next; in pop()
173 if (q->head) in pktq_penq()176 q->head = p; in pktq_penq()202 if (q->head == NULL) in pktq_penq_head()205 PKTSETLINK(p, q->head); in pktq_penq_head()206 q->head = p; in pktq_penq_head()227 if ((p = q->head) == NULL) in pktq_pdeq()230 if ((q->head = PKTLINK(p)) == NULL) in pktq_pdeq()252 if ((p = q->head) == NULL) in pktq_pdeq_tail()261 q->head = NULL; in pktq_pdeq_tail()278 p = q->head; in pktq_pflush()[all …]
60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))71 struct LST_ELEM head; member
39 delete mList.remove(mList.head()); in ~SimpleBestFitAllocator()86 chunk_t* cur = mList.head(); in alloc()134 chunk_t* cur = mList.head(); in dealloc()
42 NODE const* head() const { return mFirst; } in head() function43 NODE* head() { return mFirst; } in head() function
41 NODE const* head() const { return mFirst; } in head() function42 NODE* head() { return mFirst; } in head() function
224 int head; member592 m_sMsgQ.q[(m_sMsgQ.head + m_sMsgQ.size) % MAX_MSG].id = id; in SendMessage()594 m_sMsgQ.q[(m_sMsgQ.head + m_sMsgQ.size) % MAX_MSG].data = *data; in SendMessage()607 *msg = m_sMsgQ.q[m_sMsgQ.head]; in PopMessage()609 m_sMsgQ.head = (m_sMsgQ.head + 1) % MAX_MSG; in PopMessage()
93 void *head; member246 #define pktq_ppeek(pq, prec) ((pq)->q[prec].head)