tag | line | file | source code |
pentry | 195 | net/inet/arp.c | struct arp_table **pentry = &arp_tables[i]; |
pentry | 197 | net/inet/arp.c | while ((entry = *pentry) != NULL) |
pentry | 202 | net/inet/arp.c | *pentry = entry->next; /* remove from list */ |
pentry | 207 | net/inet/arp.c | pentry = &entry->next; /* go to next entry */ |
pentry | 263 | net/inet/arp.c | struct arp_table **pentry = &arp_tables[i]; |
pentry | 265 | net/inet/arp.c | while ((entry = *pentry) != NULL) |
pentry | 269 | net/inet/arp.c | *pentry = entry->next; /* remove from list */ |
pentry | 274 | net/inet/arp.c | pentry = &entry->next; /* go to next entry */ |
pentry | 360 | net/inet/arp.c | struct arp_table **pentry; |
pentry | 407 | net/inet/arp.c | pentry = &arp_tables[PROXY_HASH]; |
pentry | 409 | net/inet/arp.c | pentry = &arp_tables[hash]; |
pentry | 410 | net/inet/arp.c | while (*pentry != NULL) |
pentry | 412 | net/inet/arp.c | if (*pentry == entry) |
pentry | 414 | net/inet/arp.c | *pentry = entry->next; /* delete from linked list */ |
pentry | 420 | net/inet/arp.c | pentry = &(*pentry)->next; |
pentry | 488 | net/inet/arp.c | struct arp_table **pentry; |
pentry | 492 | net/inet/arp.c | pentry = &arp_tables[hash]; |
pentry | 493 | net/inet/arp.c | if (! *pentry) /* also check proxy entries */ |
pentry | 494 | net/inet/arp.c | pentry = &arp_tables[PROXY_HASH]; |
pentry | 496 | net/inet/arp.c | while ((entry = *pentry) != NULL) |
pentry | 502 | net/inet/arp.c | *pentry = entry->next; |
pentry | 508 | net/inet/arp.c | pentry = &entry->next; |
pentry | 509 | net/inet/arp.c | if (!checked_proxies && ! *pentry) |
pentry | 513 | net/inet/arp.c | pentry = &arp_tables[PROXY_HASH]; |
pentry | 117 | net/inet/rarp.c | struct rarp_table **pentry; |
pentry | 120 | net/inet/rarp.c | pentry = &rarp_tables; |
pentry | 121 | net/inet/rarp.c | while ((entry = *pentry) != NULL) |
pentry | 125 | net/inet/rarp.c | *pentry = entry->next; |
pentry | 130 | net/inet/rarp.c | pentry = &entry->next; |