Searched defs:list (Results 1 - 3 of 3) sorted by relevance
/ipc/ |
H A D | msg.c | 31 #include <linux/list.h> 65 struct list_head list; member in struct:msg_sender 166 list_add_tail(&mss->list, &msq->q_senders); 171 if (mss->list.next != NULL) 172 list_del(&mss->list); 179 list_for_each_entry_safe(mss, t, h, list) { 181 mss->list.next = NULL;
|
H A D | mqueue.c | 61 struct list_head list; member in struct:ext_wait_queue 120 /* Auxiliary functions to manipulate messages' list */ 244 INIT_LIST_HEAD(&info->e_wait_q[0].list); 245 INIT_LIST_HEAD(&info->e_wait_q[1].list); 551 list_for_each_entry(walk, &info->e_wait_q[sr].list, list) { 553 list_add_tail(&ewp->list, &walk->list); 557 list_add_tail(&ewp->list, &info->e_wait_q[sr].list); [all...] |
H A D | sem.c | 51 * - the task that performs a successful semop() scans the list of all 69 * - There are two lists of the pending operations: a per-array list 70 * and per-semaphore list (stored in the array). This allows to achieve FIFO 106 struct list_head list; /* queue of pending operations */ member in struct:sem_queue 117 /* Each task has a list of undo requests. They are executed automatically 121 struct list_head list_proc; /* per-process list: * 126 struct list_head list_id; /* per semaphore array list: 133 /* sem_undo_list controls shared access to the list of sem_undo structures 218 list_for_each_entry_safe(q, tq, &sma->pending_alter, list) { 222 list_add_tail(&q->list, [all...] |
Completed in 45 milliseconds