| eventvar.h (59290) | eventvar.h (60833) |
|---|---|
| 1/*- 2 * Copyright (c) 1999,2000 Jonathan Lemon <jlemon@FreeBSD.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 9 unchanged lines hidden (view full) --- 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 * | 1/*- 2 * Copyright (c) 1999,2000 Jonathan Lemon <jlemon@FreeBSD.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 9 unchanged lines hidden (view full) --- 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 * |
| 26 * $FreeBSD: head/sys/sys/eventvar.h 59290 2000-04-16 19:02:08Z jlemon $ | 26 * $FreeBSD: head/sys/sys/eventvar.h 60833 2000-05-23 20:41:01Z jake $ |
| 27 */ 28 29#ifndef _SYS_EVENTVAR_H_ 30#define _SYS_EVENTVAR_H_ 31 32#define KQ_NEVENTS 8 /* minimize copyout calls */ 33#define KQEXTENT 256 /* linear growth by this amount */ 34 35struct kqueue { | 27 */ 28 29#ifndef _SYS_EVENTVAR_H_ 30#define _SYS_EVENTVAR_H_ 31 32#define KQ_NEVENTS 8 /* minimize copyout calls */ 33#define KQEXTENT 256 /* linear growth by this amount */ 34 35struct kqueue { |
| 36 TAILQ_HEAD(kqlist, knote) kq_head; /* list of pending event */ | 36 TAILQ_HEAD(kqlist, struct knote) kq_head; /* list of pending event */ |
| 37 int kq_count; /* number of pending events */ 38 struct selinfo kq_sel; 39 struct filedesc *kq_fdp; 40 int kq_state; 41#define KQ_SEL 0x01 42#define KQ_SLEEP 0x02 43 union { 44 struct kevent *b_kevp[KQ_NEVENTS]; 45 struct kevent b_kev[KQ_NEVENTS]; 46 } kq_buf; 47#define kq_kevp kq_buf.b_kevp 48#define kq_kev kq_buf.b_kev 49}; 50 51#endif /* !_SYS_EVENTVAR_H_ */ | 37 int kq_count; /* number of pending events */ 38 struct selinfo kq_sel; 39 struct filedesc *kq_fdp; 40 int kq_state; 41#define KQ_SEL 0x01 42#define KQ_SLEEP 0x02 43 union { 44 struct kevent *b_kevp[KQ_NEVENTS]; 45 struct kevent b_kev[KQ_NEVENTS]; 46 } kq_buf; 47#define kq_kevp kq_buf.b_kevp 48#define kq_kev kq_buf.b_kev 49}; 50 51#endif /* !_SYS_EVENTVAR_H_ */ |