77 	struct _list_node *pnext;  member
233             pinsert->pnext = plist;  in node_insert_to_list()
236             while (plist->pnext != NULL) {  in node_insert_to_list()
237                 pdhcps_pool = plist->pnext->pnode;  in node_insert_to_list()
240                     pinsert->pnext = plist->pnext;  in node_insert_to_list()
241                     plist->pnext = pinsert;  in node_insert_to_list()
245                 plist = plist->pnext;  in node_insert_to_list()
248             if (plist->pnext == NULL) {  in node_insert_to_list()
249                 plist->pnext = pinsert;  in node_insert_to_list()
276             *phead = plist->pnext; // NOLINT(clang-analyzer-unix.Malloc)  in node_remove_from_list()
277             pdelete->pnext = NULL;  in node_remove_from_list()
280                 if (plist->pnext == pdelete) { // NOLINT(clang-analyzer-unix.Malloc)  in node_remove_from_list()
281                     plist->pnext = pdelete->pnext;  in node_remove_from_list()
282                     pdelete->pnext = NULL;  in node_remove_from_list()
285                 plist = plist->pnext;  in node_remove_from_list()
836             for (pback_node = plist; pback_node != NULL; pback_node = pback_node->pnext) {  in parse_msg()
888             pnode->pnext = NULL;  in parse_msg()
1201         pnode = pback_node->pnext;  in dhcps_stop()
1222     assert(pre != NULL && pre->pnext != NULL); // Expect the list to have at least 2 nodes  in kill_oldest_dhcps_pool()
1223     p = pre->pnext;  in kill_oldest_dhcps_pool()
1237         p = p->pnext;  in kill_oldest_dhcps_pool()
1240     minpre->pnext = minp->pnext;  in kill_oldest_dhcps_pool()
1267             pnode = pback_node->pnext;  in dhcps_coarse_tmr()
1274             pnode = pnode ->pnext;  in dhcps_coarse_tmr()
1297     for (pback_node = plist; pback_node != NULL; pback_node = pback_node->pnext) {  in dhcp_search_ip_on_mac()