Lines Matching refs:entry
93 struct async_entry *entry; in __lowest_in_progress() local
95 entry = list_first_entry(running, in __lowest_in_progress()
97 return entry->cookie; in __lowest_in_progress()
99 entry = list_first_entry(&async_pending, in __lowest_in_progress()
101 return entry->cookie; in __lowest_in_progress()
125 struct async_entry *entry; in run_one_entry() local
133 entry = list_first_entry(&async_pending, struct async_entry, list); in run_one_entry()
136 list_move_tail(&entry->list, entry->running); in run_one_entry()
141 printk("calling %lli_%pF @ %i\n", (long long)entry->cookie, in run_one_entry()
142 entry->func, task_pid_nr(current)); in run_one_entry()
145 entry->func(entry->data, entry->cookie); in run_one_entry()
150 (long long)entry->cookie, in run_one_entry()
151 entry->func, in run_one_entry()
157 list_del(&entry->list); in run_one_entry()
160 kfree(entry); in run_one_entry()
176 struct async_entry *entry; in __async_schedule() local
182 entry = kzalloc(sizeof(struct async_entry), GFP_ATOMIC); in __async_schedule()
188 if (!async_enabled || !entry || atomic_read(&entry_count) > MAX_WORK) { in __async_schedule()
189 kfree(entry); in __async_schedule()
198 entry->func = ptr; in __async_schedule()
199 entry->data = data; in __async_schedule()
200 entry->running = running; in __async_schedule()
203 newcookie = entry->cookie = next_cookie++; in __async_schedule()
204 list_add_tail(&entry->list, &async_pending); in __async_schedule()