33 netq_free_node(netq_t *node) {  in netq_free_node()  argument
34   free(node);  in netq_free_node()
50 netq_free_node(netq_t *node) {  in netq_free_node()  argument
51   memb_free(&netq_storage, node);  in netq_free_node()
61 netq_insert_node(list_t queue, netq_t *node) {  in netq_insert_node()  argument
65   assert(node);  in netq_insert_node()
68   while(p && p->t <= node->t && list_item_next(p))  in netq_insert_node()
72     list_insert(queue, p, node);  in netq_insert_node()
74     list_push(queue, node);  in netq_insert_node()
112   netq_t *node;  in netq_node_new()  local
113   node = netq_malloc_node(size);  in netq_node_new()
116   if (!node)  in netq_node_new()
120   if (node)  in netq_node_new()
121     memset(node, 0, sizeof(netq_t));  in netq_node_new()
123   return node;    in netq_node_new()
127 netq_node_free(netq_t *node) {  in netq_node_free()  argument
128   if (node)  in netq_node_free()
129     netq_free_node(node);  in netq_node_free()