109     MppMemPoolNode *node, *m;  in put_pool()  local
122         list_for_each_entry_safe(node, m, &impl->unused, MppMemPoolNode, list) {  in put_pool()
123             MPP_FREE(node);  in put_pool()
132         list_for_each_entry_safe(node, m, &impl->used, MppMemPoolNode, list) {  in put_pool()
133             MPP_FREE(node);  in put_pool()
231     MppMemPoolNode *node = NULL;  in mpp_mem_pool_get()  local
240         node = list_first_entry(&impl->unused, MppMemPoolNode, list);  in mpp_mem_pool_get()
241         if (node) {  in mpp_mem_pool_get()
242             list_del_init(&node->list);  in mpp_mem_pool_get()
243             list_add_tail(&node->list, &impl->used);  in mpp_mem_pool_get()
246             ptr = node->ptr;  in mpp_mem_pool_get()
247             node->check = node;  in mpp_mem_pool_get()
252     node = mpp_malloc_size(MppMemPoolNode, sizeof(MppMemPoolNode) + impl->size);  in mpp_mem_pool_get()
253     if (!node) {  in mpp_mem_pool_get()
258     node->check = node;  in mpp_mem_pool_get()
259     node->ptr = (void *)(node + 1);  in mpp_mem_pool_get()
260     node->size = impl->size;  in mpp_mem_pool_get()
261     INIT_LIST_HEAD(&node->list);  in mpp_mem_pool_get()
262     list_add_tail(&node->list, &impl->used);  in mpp_mem_pool_get()
264     ptr = node->ptr;  in mpp_mem_pool_get()
268     if (node)  in mpp_mem_pool_get()
269         memset(node->ptr, 0 , node->size);  in mpp_mem_pool_get()
276     MppMemPoolNode *node = (MppMemPoolNode *)((rk_u8 *)p - sizeof(MppMemPoolNode));  in mpp_mem_pool_put()  local
283     if (node != node->check) {  in mpp_mem_pool_put()
285                   p, node, node->check);  in mpp_mem_pool_put()
294     list_del_init(&node->list);  in mpp_mem_pool_put()
295     list_add(&node->list, &impl->unused);  in mpp_mem_pool_put()
298     node->check = NULL;  in mpp_mem_pool_put()