Home
last modified time | relevance | path

Searched refs:llist (Results 1 – 14 of 14) sorted by relevance

/linux/fs/smb/client/
H A Dsmb2file.c287 list_for_each_entry_safe(li, tmp, &cfile->llist->locks, llist) { in smb2_unlock_range()
304 list_del(&li->llist); in smb2_unlock_range()
316 list_move(&li->llist, &tmp_llist); in smb2_unlock_range()
329 &cfile->llist->locks); in smb2_unlock_range()
347 cifs_move_llist(&tmp_llist, &cfile->llist->locks); in smb2_unlock_range()
369 list_for_each_entry(li, &fdlocks->locks, llist) { in smb2_push_mand_fdlocks()
429 list_for_each_entry(fdlocks, &cinode->llist, llist) { in smb2_push_mandatory_locks()
H A Dfile.c636 list_for_each_entry(cur, &cinode->llist, llist) { in cifs_has_mand_locks()
689 cfile->llist = fdlocks; in cifs_new_fileinfo()
718 list_add(&fdlocks->llist, &cinode->llist); in cifs_new_fileinfo()
769 list_for_each_entry_safe(li, tmp, &cifs_file->llist->locks, llist) { in cifsFileInfo_put_final()
770 list_del(&li->llist); in cifsFileInfo_put_final()
774 list_del(&cifs_file->llist->llist); in cifsFileInfo_put_final()
1829 struct list_head llist; global() member
2111 cifs_free_llist(struct list_head * llist) cifs_free_llist() argument
[all...]
H A Dcifsglob.h1410 struct list_head llist; /* pointer to next cifsLockInfo */ member
1472 struct list_head llist; member
1482 struct cifs_fid_locks *llist; /* brlocks held by this fid */ member
1581 struct list_head llist; /* locks helb by this inode */ member
H A Dcifsproto.h334 extern void cifs_free_llist(struct list_head *llist);
H A Dcifsfs.c426 INIT_LIST_HEAD(&cifs_inode->llist); in cifs_alloc_inode()
/linux/kernel/
H A Dsmp.c393 csd = container_of(node, call_single_data_t, node.llist); in __smp_call_single_queue()
404 * llist ops. in __smp_call_single_queue()
450 __smp_call_single_queue(cpu, &csd->node.llist); in generic_exec_single()
508 llist_for_each_entry(csd, entry, node.llist) { in __flush_smp_call_function_queue()
533 llist_for_each_entry_safe(csd, csd_next, entry, node.llist) { in __flush_smp_call_function_queue()
540 prev->next = &csd_next->node.llist; in __flush_smp_call_function_queue()
542 entry = &csd_next->node.llist; in __flush_smp_call_function_queue()
550 prev = &csd->node.llist; in __flush_smp_call_function_queue()
561 llist_for_each_entry_safe(csd, csd_next, entry, node.llist) { in __flush_smp_call_function_queue()
566 prev->next = &csd_next->node.llist; in __flush_smp_call_function_queue()
[all...]
H A Dirq_work.c107 if (!llist_add(&work->node.llist, list)) in __irq_work_queue_local()
165 if (!llist_add(&work->node.llist, &per_cpu(lazy_list, cpu))) in irq_work_queue_on()
173 __smp_call_single_queue(cpu, &work->node.llist); in irq_work_queue_on()
251 llist_for_each_entry_safe(work, tmp, llnode, node.llist) in irq_work_run_list()
/linux/include/linux/
H A Dsmp_types.h5 #include <linux/llist.h>
59 struct llist_node llist; member
H A Drethook.h11 #include <linux/llist.h>
44 * @llist: The llist, linked to a struct task_struct::rethooks.
54 struct llist_node llist; member
H A Dkprobes.h167 struct llist_node llist;
/linux/drivers/tty/
H A Dtty_buffer.c124 struct llist_node *llist; in tty_buffer_free_all() local
134 llist = llist_del_all(&buf->free); in tty_buffer_free_all()
135 llist_for_each_entry_safe(p, next, llist, free) in tty_buffer_free_all()
/linux/net/rds/
H A Dib_rdma.c36 #include <linux/llist.h>
289 * given an llist of mrs, put them all into the list_head for more processing
291 static unsigned int llist_append_to_list(struct llist_head *llist, in llist_append_to_list() argument
299 node = llist_del_all(llist); in llist_append_to_list()
311 * this takes a list head of mrs and turns it into linked llist nodes
312 * of clusters. Each cluster has linked llist nodes of
415 /* more than one entry in llist nodes */ in rds_ib_flush_mr_pool()
/linux/lib/
H A DMakefile56 bsearch.o find_bit.o llist.o lwq.o memweight.o kfifo.o \
/linux/drivers/gpu/drm/i915/
H A Di915_request.c200 work.node.llist) in __notify_execute_cb()
531 if (llist_add(&cb->work.node.llist, &signal->execute_cb)) { in __await_execution()