tag | line | file | source code |
pentry | 205 | net/inet/arp.c | struct arp_table **pentry = &arp_tables[i]; |
pentry | 207 | net/inet/arp.c | while ((entry = *pentry) != NULL) |
pentry | 212 | net/inet/arp.c | *pentry = entry->next; /* remove from list */ |
pentry | 217 | net/inet/arp.c | pentry = &entry->next; /* go to next entry */ |
pentry | 277 | net/inet/arp.c | struct arp_table **pentry = &arp_tables[i]; |
pentry | 279 | net/inet/arp.c | while ((entry = *pentry) != NULL) |
pentry | 283 | net/inet/arp.c | *pentry = entry->next; /* remove from list */ |
pentry | 288 | net/inet/arp.c | pentry = &entry->next; /* go to next entry */ |
pentry | 375 | net/inet/arp.c | struct arp_table **pentry; |
pentry | 422 | net/inet/arp.c | pentry = &arp_tables[PROXY_HASH]; |
pentry | 424 | net/inet/arp.c | pentry = &arp_tables[hash]; |
pentry | 425 | net/inet/arp.c | while (*pentry != NULL) |
pentry | 427 | net/inet/arp.c | if (*pentry == entry) |
pentry | 429 | net/inet/arp.c | *pentry = entry->next; /* delete from linked list */ |
pentry | 435 | net/inet/arp.c | pentry = &(*pentry)->next; |
pentry | 503 | net/inet/arp.c | struct arp_table **pentry; |
pentry | 508 | net/inet/arp.c | pentry = &arp_tables[hash]; |
pentry | 509 | net/inet/arp.c | if (! *pentry) /* also check proxy entries */ |
pentry | 510 | net/inet/arp.c | pentry = &arp_tables[PROXY_HASH]; |
pentry | 512 | net/inet/arp.c | while ((entry = *pentry) != NULL) |
pentry | 518 | net/inet/arp.c | *pentry = entry->next; |
pentry | 529 | net/inet/arp.c | pentry = &entry->next; |
pentry | 530 | net/inet/arp.c | if (!checked_proxies && ! *pentry) |
pentry | 534 | net/inet/arp.c | pentry = &arp_tables[PROXY_HASH]; |
pentry | 118 | net/inet/rarp.c | struct rarp_table **pentry; |
pentry | 121 | net/inet/rarp.c | pentry = &rarp_tables; |
pentry | 122 | net/inet/rarp.c | while ((entry = *pentry) != NULL) |
pentry | 126 | net/inet/rarp.c | *pentry = entry->next; |
pentry | 131 | net/inet/rarp.c | pentry = &entry->next; |