Home
last modified time | relevance | path

Searched refs:worklist (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Drefcount.c150 struct list_head worklist; in xchk_refcountbt_process_rmap_fragments() local
171 INIT_LIST_HEAD(&worklist); in xchk_refcountbt_process_rmap_fragments()
184 * and put them on the worklist. in xchk_refcountbt_process_rmap_fragments()
193 list_move_tail(&frag->list, &worklist); in xchk_refcountbt_process_rmap_fragments()
205 /* Discard any fragments ending at rbno from the worklist. */ in xchk_refcountbt_process_rmap_fragments()
208 list_for_each_entry_safe(frag, n, &worklist, list) { in xchk_refcountbt_process_rmap_fragments()
220 /* Try to add nr rmaps starting at rbno to the worklist. */ in xchk_refcountbt_process_rmap_fragments()
225 list_move_tail(&frag->list, &worklist); in xchk_refcountbt_process_rmap_fragments()
235 * items to the worklist than we discarded because the fragment in xchk_refcountbt_process_rmap_fragments()
256 list_for_each_entry_safe(frag, n, &worklist, lis in xchk_refcountbt_process_rmap_fragments()
[all...]
/kernel/linux/linux-6.6/fs/xfs/scrub/
H A Drefcount.c155 struct list_head worklist; in xchk_refcountbt_process_rmap_fragments() local
176 INIT_LIST_HEAD(&worklist); in xchk_refcountbt_process_rmap_fragments()
189 * and put them on the worklist. in xchk_refcountbt_process_rmap_fragments()
198 list_move_tail(&frag->list, &worklist); in xchk_refcountbt_process_rmap_fragments()
210 /* Discard any fragments ending at rbno from the worklist. */ in xchk_refcountbt_process_rmap_fragments()
213 list_for_each_entry_safe(frag, n, &worklist, list) { in xchk_refcountbt_process_rmap_fragments()
225 /* Try to add nr rmaps starting at rbno to the worklist. */ in xchk_refcountbt_process_rmap_fragments()
230 list_move_tail(&frag->list, &worklist); in xchk_refcountbt_process_rmap_fragments()
240 * items to the worklist than we discarded because the fragment in xchk_refcountbt_process_rmap_fragments()
261 list_for_each_entry_safe(frag, n, &worklist, lis in xchk_refcountbt_process_rmap_fragments()
[all...]
/kernel/linux/linux-5.10/kernel/
H A Dworkqueue.c157 struct list_head worklist; /* L: list of pending works */ member
610 * but stay off timer and worklist for arbitrarily long and nobody should
778 * worklist isn't empty.
782 return !list_empty(&pool->worklist) && __need_more_worker(pool); in need_more_worker()
794 return !list_empty(&pool->worklist) && in keep_working()
902 * worklist not empty test sequence is in insert_work(). in wq_worker_sleeping()
912 !list_empty(&pool->worklist)) { in wq_worker_sleeping()
1056 * @nextp: out parameter for nested worklist walking
1075 * Linked worklist will always end before the end of the list, in move_linked_works()
1156 if (list_empty(&pwq->pool->worklist)) in pwq_activate_inactive_work()
1413 struct list_head *worklist; __queue_work() local
[all...]
/kernel/linux/linux-6.6/kernel/
H A Dworkqueue.c177 struct list_head worklist; /* L: list of pending works */ member
246 * pwq->inactive_works instead of pool->worklist and marked with
253 * pool->worklist or worker->scheduled. Those work itmes are only struct
724 * but stay off timer and worklist for arbitrarily long and nobody should
887 * worklist isn't empty.
891 return !list_empty(&pool->worklist) && !pool->nr_running; in need_more_worker()
903 return !list_empty(&pool->worklist) && (pool->nr_running <= 1); in keep_working()
1084 * @nextp: out parameter for nested worklist walking
1100 * Linked worklist will always end before the end of the list, in move_linked_works()
1122 * @nextp: out parameter for nested worklist walkin
[all...]

Completed in 10 milliseconds