Home
last modified time | relevance | path

Searched refs:ptr (Results 1 – 3 of 3) sorted by relevance

/ipc/
Dutil.c470 void ipc_free(void* ptr, int size) in ipc_free() argument
473 vfree(ptr); in ipc_free()
475 kfree(ptr); in ipc_free()
558 void ipc_rcu_getref(void *ptr) in ipc_rcu_getref() argument
560 container_of(ptr, struct ipc_rcu_hdr, data)->refcount++; in ipc_rcu_getref()
601 void ipc_rcu_putref(void *ptr) in ipc_rcu_putref() argument
603 if (--container_of(ptr, struct ipc_rcu_hdr, data)->refcount > 0) in ipc_rcu_putref()
606 if (container_of(ptr, struct ipc_rcu_hdr, data)->is_vmalloc) { in ipc_rcu_putref()
607 call_rcu(&container_of(ptr, struct ipc_rcu_grace, data)->rcu, in ipc_rcu_putref()
610 call_rcu(&container_of(ptr, struct ipc_rcu_grace, data)->rcu, in ipc_rcu_putref()
Dutil.h93 void ipc_free(void* ptr, int size);
102 void ipc_rcu_getref(void *ptr);
103 void ipc_rcu_putref(void *ptr);
Dmqueue.c451 struct list_head *ptr; in wq_get_first_waiter() local
453 ptr = info->e_wait_q[sr].list.prev; in wq_get_first_waiter()
454 if (ptr == &info->e_wait_q[sr].list) in wq_get_first_waiter()
456 return list_entry(ptr, struct ext_wait_queue, list); in wq_get_first_waiter()
460 static void msg_insert(struct msg_msg *ptr, struct mqueue_inode_info *info) in msg_insert() argument
465 while (k >= 0 && info->messages[k]->m_type >= ptr->m_type) { in msg_insert()
470 info->qsize += ptr->m_ts; in msg_insert()
471 info->messages[k + 1] = ptr; in msg_insert()