mirror of
				https://git.kernel.org/pub/scm/linux/kernel/git/chenhuacai/linux-loongson
				synced 2025-10-31 12:39:23 +00:00 
			
		
		
		
	 1da177e4c3
			
		
	
	
		1da177e4c3
		
	
	
	
	
		
			
			Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
		
			
				
	
	
		
			100 lines
		
	
	
		
			2.1 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			100 lines
		
	
	
		
			2.1 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| #ifndef _LINUX_POLL_H
 | |
| #define _LINUX_POLL_H
 | |
| 
 | |
| #include <asm/poll.h>
 | |
| 
 | |
| #ifdef __KERNEL__
 | |
| 
 | |
| #include <linux/compiler.h>
 | |
| #include <linux/wait.h>
 | |
| #include <linux/string.h>
 | |
| #include <linux/mm.h>
 | |
| #include <asm/uaccess.h>
 | |
| 
 | |
| struct poll_table_struct;
 | |
| 
 | |
| /* 
 | |
|  * structures and helpers for f_op->poll implementations
 | |
|  */
 | |
| typedef void (*poll_queue_proc)(struct file *, wait_queue_head_t *, struct poll_table_struct *);
 | |
| 
 | |
| typedef struct poll_table_struct {
 | |
| 	poll_queue_proc qproc;
 | |
| } poll_table;
 | |
| 
 | |
| static inline void poll_wait(struct file * filp, wait_queue_head_t * wait_address, poll_table *p)
 | |
| {
 | |
| 	if (p && wait_address)
 | |
| 		p->qproc(filp, wait_address, p);
 | |
| }
 | |
| 
 | |
| static inline void init_poll_funcptr(poll_table *pt, poll_queue_proc qproc)
 | |
| {
 | |
| 	pt->qproc = qproc;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Structures and helpers for sys_poll/sys_poll
 | |
|  */
 | |
| struct poll_wqueues {
 | |
| 	poll_table pt;
 | |
| 	struct poll_table_page * table;
 | |
| 	int error;
 | |
| };
 | |
| 
 | |
| extern void poll_initwait(struct poll_wqueues *pwq);
 | |
| extern void poll_freewait(struct poll_wqueues *pwq);
 | |
| 
 | |
| /*
 | |
|  * Scaleable version of the fd_set.
 | |
|  */
 | |
| 
 | |
| typedef struct {
 | |
| 	unsigned long *in, *out, *ex;
 | |
| 	unsigned long *res_in, *res_out, *res_ex;
 | |
| } fd_set_bits;
 | |
| 
 | |
| /*
 | |
|  * How many longwords for "nr" bits?
 | |
|  */
 | |
| #define FDS_BITPERLONG	(8*sizeof(long))
 | |
| #define FDS_LONGS(nr)	(((nr)+FDS_BITPERLONG-1)/FDS_BITPERLONG)
 | |
| #define FDS_BYTES(nr)	(FDS_LONGS(nr)*sizeof(long))
 | |
| 
 | |
| /*
 | |
|  * We do a VERIFY_WRITE here even though we are only reading this time:
 | |
|  * we'll write to it eventually..
 | |
|  *
 | |
|  * Use "unsigned long" accesses to let user-mode fd_set's be long-aligned.
 | |
|  */
 | |
| static inline
 | |
| int get_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
 | |
| {
 | |
| 	nr = FDS_BYTES(nr);
 | |
| 	if (ufdset)
 | |
| 		return copy_from_user(fdset, ufdset, nr) ? -EFAULT : 0;
 | |
| 
 | |
| 	memset(fdset, 0, nr);
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static inline unsigned long __must_check
 | |
| set_fd_set(unsigned long nr, void __user *ufdset, unsigned long *fdset)
 | |
| {
 | |
| 	if (ufdset)
 | |
| 		return __copy_to_user(ufdset, fdset, FDS_BYTES(nr));
 | |
| 	return 0;
 | |
| }
 | |
| 
 | |
| static inline
 | |
| void zero_fd_set(unsigned long nr, unsigned long *fdset)
 | |
| {
 | |
| 	memset(fdset, 0, FDS_BYTES(nr));
 | |
| }
 | |
| 
 | |
| extern int do_select(int n, fd_set_bits *fds, long *timeout);
 | |
| 
 | |
| #endif /* KERNEL */
 | |
| 
 | |
| #endif /* _LINUX_POLL_H */
 |