Lines Matching refs:head
66 struct list *head;
125 struct list_pid *prev, *free_node, *head = *pids;
128 if (!head) return NULL;
130 while (head) {
131 if (head->pid == pid) {
132 ip = head->ip;
133 free_node = head;
134 if (!prev) *pids = head->next;
135 else prev->next = head->next;
139 prev = head;
140 head = head->next;
148 struct list *head, *prev = NULL, *free_node = NULL;
151 head = h[hash].head;
152 while (head) {
153 if (!strcmp(ip, head->d)) {
154 head->count--;
155 free_node = head;
156 if (!head->count) {
157 if (!prev) h[hash].head = head->next;
158 else prev->next = head->next;
163 prev = head;
164 head = head->next;
270 struct list *head, *newnode;
302 for (j = 0; j < HASH_NR; j++) h[j].head = NULL;
327 for (head = h[hash].head; head; head = head->next)
328 if (!strcmp(head->d, addr)) break;
330 if (head && head->count >= TT.maxc) {
340 for (head = h[hash].head; head; head = head->next) {
341 if (!strcmp(addr, head->d)) {
342 head->count++;
348 if (!head) {
349 newnode->next = h[hash].head;
350 h[hash].head = newnode;
351 h[hash].head->count++;