| 1 | /*- |
| 2 | * SPDX-License-Identifier: BSD-2-Clause |
| 3 | * |
| 4 | * Copyright (c) 1999,2000 Jonathan Lemon <jlemon@FreeBSD.org> |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions |
| 9 | * are met: |
| 10 | * 1. Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright |
| 13 | * notice, this list of conditions and the following disclaimer in the |
| 14 | * documentation and/or other materials provided with the distribution. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 17 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 20 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 21 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 22 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 23 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 24 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 25 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 26 | * SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | #ifndef _SYS_EVENTVAR_H_ |
| 30 | #define _SYS_EVENTVAR_H_ |
| 31 | |
| 32 | #ifndef _KERNEL |
| 33 | #error "no user-serviceable parts inside" |
| 34 | #endif |
| 35 | |
| 36 | #include <sys/_task.h> |
| 37 | |
| 38 | #define KQ_NEVENTS 8 /* minimize copy{in,out} calls */ |
| 39 | #define KQEXTENT 256 /* linear growth by this amount */ |
| 40 | |
| 41 | struct kqueue { |
| 42 | struct mtx kq_lock; |
| 43 | int kq_refcnt; |
| 44 | TAILQ_ENTRY(kqueue) kq_list; |
| 45 | TAILQ_HEAD(, knote) kq_head; /* list of pending event */ |
| 46 | int kq_count; /* number of pending events */ |
| 47 | struct selinfo kq_sel; |
| 48 | struct sigio *kq_sigio; |
| 49 | struct filedesc *kq_fdp; |
| 50 | int kq_state; |
| 51 | #define KQ_SEL 0x01 |
| 52 | #define KQ_SLEEP 0x02 |
| 53 | #define KQ_FLUXWAIT 0x04 /* waiting for a in flux kn */ |
| 54 | #define KQ_ASYNC 0x08 |
| 55 | #define KQ_CLOSING 0x10 |
| 56 | #define KQ_TASKSCHED 0x20 /* task scheduled */ |
| 57 | #define KQ_TASKDRAIN 0x40 /* waiting for task to drain */ |
| 58 | int kq_knlistsize; /* size of knlist */ |
| 59 | struct klist *kq_knlist; /* list of knotes */ |
| 60 | u_long kq_knhashmask; /* size of knhash */ |
| 61 | struct klist *kq_knhash; /* hash table for knotes */ |
| 62 | struct task kq_task; |
| 63 | struct ucred *kq_cred; |
| 64 | }; |
| 65 | |
| 66 | #endif /* !_SYS_EVENTVAR_H_ */ |