Home
last modified time | relevance | path

Searched refs:unode (Results 1 – 6 of 6) sorted by relevance

/linux/drivers/gpu/drm/udl/
H A Dudl_main.c152 struct urb_node *unode = urb->context; in udl_urb_completion() local
153 struct udl_device *udl = unode->dev; in udl_urb_completion()
170 list_add_tail(&unode->entry, &udl->urbs.list); in udl_urb_completion()
179 struct urb_node *unode; in udl_free_urb_list() local
192 unode = urb->context; in udl_free_urb_list()
197 kfree(unode); in udl_free_urb_list()
206 struct urb_node *unode; in udl_alloc_urb_list() local
221 unode = kzalloc(sizeof(struct urb_node), GFP_KERNEL); in udl_alloc_urb_list()
222 if (!unode) in udl_alloc_urb_list()
224 unode in udl_alloc_urb_list()
264 struct urb_node *unode; udl_get_urb_locked() local
[all...]
/linux/fs/btrfs/
H A Dulist.c135 const struct ulist_node *unode = rb_entry(node, struct ulist_node, rb_node); in ulist_node_val_key_cmp() local
137 if (unode->val < *val) in ulist_node_val_key_cmp()
139 else if (unode->val > *val) in ulist_node_val_key_cmp()
164 const struct ulist_node *unode = rb_entry(new, struct ulist_node, rb_node); in ulist_node_val_cmp() local
166 return ulist_node_val_key_cmp(&unode->val, existing); in ulist_node_val_cmp()
H A Dqgroup.c2732 struct ulist_node *unode; in qgroup_update_refcnt() local
2739 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2742 qg = find_qgroup_rb(fs_info, unode->val); in qgroup_update_refcnt()
2892 struct ulist_node *unode; in maybe_fs_roots() local
2900 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
2901 if (!unode) in maybe_fs_roots()
2909 return btrfs_is_fstree(unode->val); in maybe_fs_roots()
4281 struct ulist_node *unode; in qgroup_free_reserved_data() local
4292 while ((unode = ulist_next(&reserved->range_changed, &uiter))) { in qgroup_free_reserved_data()
4293 u64 range_start = unode in qgroup_free_reserved_data()
4597 struct ulist_node *unode; btrfs_qgroup_check_reserved_leak() local
[all...]
/linux/drivers/video/fbdev/
H A Dsmscufx.c1083 struct urb_node *unode = container_of(work, struct urb_node, in ufx_release_urb_work() local
1086 up(&unode->dev->urbs.limit_sem); in ufx_release_urb_work()
1771 struct urb_node *unode = urb->context; in ufx_urb_completion() local
1772 struct ufx_data *dev = unode->dev; in ufx_urb_completion()
1789 list_add_tail(&unode->entry, &dev->urbs.list); in ufx_urb_completion()
1796 schedule_delayed_work(&unode->release_urb_work, 0); in ufx_urb_completion()
1805 struct urb_node *unode; in ufx_free_urb_list() local
1826 unode = list_entry(node, struct urb_node, entry); in ufx_free_urb_list()
1827 urb = unode->urb; in ufx_free_urb_list()
1841 struct urb_node *unode; in ufx_alloc_urb_list() local
1896 struct urb_node *unode; ufx_get_urb() local
[all...]
H A Dudlfb.c1775 struct urb_node *unode = urb->context; in dlfb_urb_completion() local
1776 struct dlfb_data *dlfb = unode->dlfb; in dlfb_urb_completion()
1799 list_add_tail(&unode->entry, &dlfb->urbs.list); in dlfb_urb_completion()
1810 struct urb_node *unode; in dlfb_free_urb_list() local
1824 unode = list_entry(node, struct urb_node, entry); in dlfb_free_urb_list()
1825 urb = unode->urb; in dlfb_free_urb_list()
1840 struct urb_node *unode; in dlfb_alloc_urb_list() local
1855 unode = kzalloc(sizeof(*unode), GFP_KERNEL); in dlfb_alloc_urb_list()
1856 if (!unode) in dlfb_alloc_urb_list()
1900 struct urb_node *unode; dlfb_get_urb() local
[all...]
/linux/fs/hpfs/
H A Danode.c246 struct anode *unode; in hpfs_add_sector_to_btree() local
247 if ((unode = hpfs_map_anode(s, le32_to_cpu(ranode->u.internal[n].down), &bh1))) { in hpfs_add_sector_to_btree()
248 unode->up = cpu_to_le32(ra); in hpfs_add_sector_to_btree()
249 unode->btree.flags &= ~BP_fnode_parent; in hpfs_add_sector_to_btree()