Searched refs:new_entry (Results 1 – 7 of 7) sorted by relevance
72 err_t ip_nat_add(const ip_nat_entry_t *new_entry);
264 ip_nat_add(const ip_nat_entry_t *new_entry) in ip_nat_add() argument269 LWIP_ASSERT("new_entry != NULL", new_entry != NULL); in ip_nat_add()272 SMEMCPY(&ip_nat_cfg_new->entry, new_entry, sizeof(ip_nat_entry_t)); in ip_nat_add()
1029 struct etharp_q_entry *new_entry; local1031 new_entry = (struct etharp_q_entry *)memp_malloc(MEMP_ARP_QUEUE);1032 if (new_entry != NULL) {1034 new_entry->next = 0;1035 new_entry->p = p;1045 r->next = new_entry;1048 arp_table[i].q = new_entry;
1028 struct etharp_q_entry *new_entry; local1030 new_entry = (struct etharp_q_entry *)memp_malloc(MEMP_ARP_QUEUE);1031 if (new_entry != NULL) {1033 new_entry->next = 0;1034 new_entry->p = p;1044 r->next = new_entry;1047 arp_table[i].q = new_entry;
1111 struct etharp_q_entry *new_entry; local1113 new_entry = (struct etharp_q_entry *)memp_malloc(MEMP_ARP_QUEUE);1114 if (new_entry != NULL) {1115 new_entry->next = 0;1116 new_entry->p = p;1124 r->next = new_entry;1127 arp_table[i].q = new_entry;
1737 struct nd6_q_entry *new_entry, *r; in nd6_queue_packet() local1787 new_entry = (struct nd6_q_entry *)memp_malloc(MEMP_ND6_QUEUE); in nd6_queue_packet()1788 if ((new_entry == NULL) && (neighbor_cache[neighbor_index].q != NULL)) { in nd6_queue_packet()1794 new_entry = (struct nd6_q_entry *)memp_malloc(MEMP_ND6_QUEUE); in nd6_queue_packet()1796 if (new_entry != NULL) { in nd6_queue_packet()1797 new_entry->next = NULL; in nd6_queue_packet()1798 new_entry->p = p; in nd6_queue_packet()1805 r->next = new_entry; in nd6_queue_packet()1808 neighbor_cache[neighbor_index].q = new_entry; in nd6_queue_packet()
2075 struct nd6_q_entry *new_entry, *r; in nd6_queue_packet() local2118 new_entry = (struct nd6_q_entry *)memp_malloc(MEMP_ND6_QUEUE); in nd6_queue_packet()2119 if ((new_entry == NULL) && (neighbor_cache[neighbor_index].q != NULL)) { in nd6_queue_packet()2125 new_entry = (struct nd6_q_entry *)memp_malloc(MEMP_ND6_QUEUE); in nd6_queue_packet()2127 if (new_entry != NULL) { in nd6_queue_packet()2128 new_entry->next = NULL; in nd6_queue_packet()2129 new_entry->p = p; in nd6_queue_packet()2136 r->next = new_entry; in nd6_queue_packet()2139 neighbor_cache[neighbor_index].q = new_entry; in nd6_queue_packet()
Completed in 18 milliseconds