Home
last modified time | relevance | path

Searched refs:pt (Results 1 – 8 of 8) sorted by relevance

/fs/
Deventpoll.c251 poll_table pt; member
355 return container_of(p, struct ep_pqueue, pt)->epi; in ep_item_from_epqueue()
878 poll_table *pt);
885 static __poll_t ep_item_poll(const struct epitem *epi, poll_table *pt, in ep_item_poll() argument
891 pt->_key = epi->event.events; in ep_item_poll()
893 return vfs_poll(epi->ffd.file, pt) & epi->event.events; in ep_item_poll()
896 poll_wait(epi->ffd.file, &ep->poll_wait, pt); in ep_item_poll()
897 locked = pt && (pt->_qproc == ep_ptable_queue_proc); in ep_item_poll()
908 poll_table pt; in ep_read_events_proc() local
911 init_poll_funcptr(&pt, NULL); in ep_read_events_proc()
[all …]
Dselect.c123 init_poll_funcptr(&pwq->pt, __pollwait); in poll_initwait()
224 struct poll_wqueues *pwq = container_of(p, struct poll_wqueues, pt); in __pollwait()
495 wait = &table.pt; in do_select()
874 poll_table* pt = &wait->pt; in do_poll() local
883 pt->_qproc = NULL; in do_poll()
907 if (do_pollfd(pfd, pt, &can_busy_loop, in do_poll()
910 pt->_qproc = NULL; in do_poll()
921 pt->_qproc = NULL; in do_poll()
Daio.c1617 struct poll_table_struct pt = { ._key = req->events }; in aio_poll_complete_work() local
1622 mask = vfs_poll(req->file, &pt) & req->events; in aio_poll_complete_work()
1695 struct poll_table_struct pt; member
1704 struct aio_poll_table *pt = container_of(p, struct aio_poll_table, pt); in aio_poll_queue_proc() local
1707 if (unlikely(pt->iocb->poll.head)) { in aio_poll_queue_proc()
1708 pt->error = -EINVAL; in aio_poll_queue_proc()
1712 pt->error = 0; in aio_poll_queue_proc()
1713 pt->iocb->poll.head = head; in aio_poll_queue_proc()
1714 add_wait_queue(head, &pt->iocb->poll.wait); in aio_poll_queue_proc()
1739 apt.pt._qproc = aio_poll_queue_proc; in aio_poll()
[all …]
Dio_uring.c1771 struct poll_table_struct pt = { ._key = poll->events }; in io_poll_complete_work() local
1779 mask = vfs_poll(poll->file, &pt) & poll->events; in io_poll_complete_work()
1835 struct poll_table_struct pt; member
1843 struct io_poll_table *pt = container_of(p, struct io_poll_table, pt); in io_poll_queue_proc() local
1845 if (unlikely(pt->req->poll.head)) { in io_poll_queue_proc()
1846 pt->error = -EINVAL; in io_poll_queue_proc()
1850 pt->error = 0; in io_poll_queue_proc()
1851 pt->req->poll.head = head; in io_poll_queue_proc()
1852 add_wait_queue(head, &pt->req->poll.wait); in io_poll_queue_proc()
1880 ipt.pt._qproc = io_poll_queue_proc; in io_poll_add()
[all …]
Dnamei.c780 struct path *pt = &nd->path; in success_walk_trace() local
811 p = d_path(pt, try_buf, cur_path_size); in success_walk_trace()
/fs/ntfs/
Dcompress.c332 u16 lg, pt, length, max_non_overlap; in ntfs_decompress() local
372 pt = le16_to_cpup((le16*)cb); in ntfs_decompress()
379 dp_back_addr = dp_addr - (pt >> (12 - lg)) - 1; in ntfs_decompress()
384 length = (pt & (0xfff >> lg)) + 3; in ntfs_decompress()
/fs/ecryptfs/
Dmiscdev.c29 ecryptfs_miscdev_poll(struct file *file, poll_table *pt) in ecryptfs_miscdev_poll() argument
46 poll_wait(file, &daemon->wait, pt); in ecryptfs_miscdev_poll()
/fs/btrfs/
Dsend.c1126 struct fs_path *pt = ctx; in __copy_first_ref() local
1128 ret = fs_path_copy(pt, p); in __copy_first_ref()