1*8a272653SPeter Holm#!/bin/sh 2*8a272653SPeter Holm 3*8a272653SPeter Holm# 4*8a272653SPeter Holm# Copyright (c) 2008 Peter Holm <pho@FreeBSD.org> 5*8a272653SPeter Holm# All rights reserved. 6*8a272653SPeter Holm# 7*8a272653SPeter Holm# Redistribution and use in source and binary forms, with or without 8*8a272653SPeter Holm# modification, are permitted provided that the following conditions 9*8a272653SPeter Holm# are met: 10*8a272653SPeter Holm# 1. Redistributions of source code must retain the above copyright 11*8a272653SPeter Holm# notice, this list of conditions and the following disclaimer. 12*8a272653SPeter Holm# 2. Redistributions in binary form must reproduce the above copyright 13*8a272653SPeter Holm# notice, this list of conditions and the following disclaimer in the 14*8a272653SPeter Holm# documentation and/or other materials provided with the distribution. 15*8a272653SPeter Holm# 16*8a272653SPeter Holm# THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17*8a272653SPeter Holm# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18*8a272653SPeter Holm# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19*8a272653SPeter Holm# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 20*8a272653SPeter Holm# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21*8a272653SPeter Holm# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22*8a272653SPeter Holm# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23*8a272653SPeter Holm# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24*8a272653SPeter Holm# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25*8a272653SPeter Holm# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26*8a272653SPeter Holm# SUCH DAMAGE. 27*8a272653SPeter Holm# 28*8a272653SPeter Holm 29*8a272653SPeter Holm. ../default.cfg 30*8a272653SPeter Holm 31*8a272653SPeter Holmodir=`pwd` 32*8a272653SPeter Holm 33*8a272653SPeter Holmcd /tmp 34*8a272653SPeter Holmsed '1,/^EOF/d' < $odir/$0 > kevent2.c 35*8a272653SPeter Holmmycc -o kevent2 -Wall kevent2.c -pthread || exit 1 36*8a272653SPeter Holmrm -f kevent2.c 37*8a272653SPeter Holmcd $RUNDIR 38*8a272653SPeter Holm 39*8a272653SPeter Holmfor i in `jot 10`; do 40*8a272653SPeter Holm for j in `jot 12`; do 41*8a272653SPeter Holm /tmp/kevent2 > /dev/null 2>&1 & 42*8a272653SPeter Holm done 43*8a272653SPeter Holm wait 44*8a272653SPeter Holmdone 45*8a272653SPeter Holmrm -f /tmp/kevent2 46*8a272653SPeter Holmexit 47*8a272653SPeter HolmEOF 48*8a272653SPeter Holm#include <sys/types.h> 49*8a272653SPeter Holm#include <sys/event.h> 50*8a272653SPeter Holm#include <sys/time.h> 51*8a272653SPeter Holm 52*8a272653SPeter Holm#include <err.h> 53*8a272653SPeter Holm#include <pthread.h> 54*8a272653SPeter Holm#include <stdio.h> 55*8a272653SPeter Holm#include <stdlib.h> 56*8a272653SPeter Holm#include <string.h> 57*8a272653SPeter Holm#include <unistd.h> 58*8a272653SPeter Holm 59*8a272653SPeter Holmpthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; 60*8a272653SPeter Holmpthread_cond_t cond = PTHREAD_COND_INITIALIZER; 61*8a272653SPeter Holmstatic int waiting; 62*8a272653SPeter Holm 63*8a272653SPeter Holmstatic int fd1[2]; 64*8a272653SPeter Holmstatic int fd2[2]; 65*8a272653SPeter Holmstatic int fd3[2]; 66*8a272653SPeter Holm 67*8a272653SPeter Holmstatic void * 68*8a272653SPeter Holmthr1(void *arg) 69*8a272653SPeter Holm{ 70*8a272653SPeter Holm struct kevent ev[3]; 71*8a272653SPeter Holm struct timespec ts; 72*8a272653SPeter Holm int kq, n, r; 73*8a272653SPeter Holm 74*8a272653SPeter Holm if ((kq = kqueue()) < 0) 75*8a272653SPeter Holm err(1, "kqueue(). %s:%d", __FILE__, __LINE__); 76*8a272653SPeter Holm 77*8a272653SPeter Holm n = 0; 78*8a272653SPeter Holm EV_SET(&ev[n], fd1[1], EVFILT_WRITE, 79*8a272653SPeter Holm EV_ADD | EV_ENABLE | EV_CLEAR, 0, 0, 0); 80*8a272653SPeter Holm n++; 81*8a272653SPeter Holm EV_SET(&ev[n], fd2[1], EVFILT_WRITE, 82*8a272653SPeter Holm EV_ADD | EV_ENABLE | EV_CLEAR, 0, 0, 0); 83*8a272653SPeter Holm n++; 84*8a272653SPeter Holm EV_SET(&ev[n], fd3[1], EVFILT_WRITE, 85*8a272653SPeter Holm EV_ADD | EV_ENABLE | EV_CLEAR, 0, 0, 0); 86*8a272653SPeter Holm n++; 87*8a272653SPeter Holm 88*8a272653SPeter Holm if (kevent(kq, ev, n, NULL, 0, NULL) < 0) 89*8a272653SPeter Holm err(1, "kevent(). %s:%d", __FILE__, __LINE__); 90*8a272653SPeter Holm 91*8a272653SPeter Holm if ((r = pthread_mutex_lock(&mutex)) != 0) 92*8a272653SPeter Holm errc(1, r, "pthread_mutex_lock"); 93*8a272653SPeter Holm waiting = 0; 94*8a272653SPeter Holm if ((r = pthread_cond_signal(&cond)) != 0) 95*8a272653SPeter Holm errc(1, r, "pthread_cond_signal"); 96*8a272653SPeter Holm if ((r = pthread_mutex_unlock(&mutex)) != 0) 97*8a272653SPeter Holm errc(1, r, "pthread_mutex_unlock"); 98*8a272653SPeter Holm 99*8a272653SPeter Holm n = 0; 100*8a272653SPeter Holm EV_SET(&ev[n], fd1[1], EVFILT_WRITE, 101*8a272653SPeter Holm EV_DELETE, 0, 0, 0); 102*8a272653SPeter Holm n++; 103*8a272653SPeter Holm ts.tv_sec = 0; 104*8a272653SPeter Holm ts.tv_nsec = 0; 105*8a272653SPeter Holm if (kevent(kq, ev, n, NULL, 0, &ts) < 0) 106*8a272653SPeter Holm err(1, "kevent(). %s:%d", __FILE__, __LINE__); 107*8a272653SPeter Holm close(kq); 108*8a272653SPeter Holm 109*8a272653SPeter Holm close(fd1[1]); 110*8a272653SPeter Holm close(fd2[1]); 111*8a272653SPeter Holm close(fd3[1]); 112*8a272653SPeter Holm return (0); 113*8a272653SPeter Holm} 114*8a272653SPeter Holm 115*8a272653SPeter Holmstatic void * 116*8a272653SPeter Holmthr2(void *arg) 117*8a272653SPeter Holm{ 118*8a272653SPeter Holm int r; 119*8a272653SPeter Holm 120*8a272653SPeter Holm if ((r = pthread_mutex_lock(&mutex)) != 0) 121*8a272653SPeter Holm errc(1, r, "pthread_mutex_lock"); 122*8a272653SPeter Holm while (waiting == 1) { 123*8a272653SPeter Holm if ((r = pthread_cond_wait(&cond, &mutex)) != 0) 124*8a272653SPeter Holm errc(1, r, "pthread_cond_wait"); 125*8a272653SPeter Holm } 126*8a272653SPeter Holm if ((r = pthread_mutex_unlock(&mutex)) != 0) 127*8a272653SPeter Holm errc(1, r, "pthread_mutex_unlock"); 128*8a272653SPeter Holm close(fd1[0]); 129*8a272653SPeter Holm close(fd2[0]); 130*8a272653SPeter Holm close(fd3[0]); 131*8a272653SPeter Holm return (0); 132*8a272653SPeter Holm} 133*8a272653SPeter Holm 134*8a272653SPeter Holmint 135*8a272653SPeter Holmmain(int argc, char **argv) 136*8a272653SPeter Holm{ 137*8a272653SPeter Holm pthread_t threads[2]; 138*8a272653SPeter Holm int i, r; 139*8a272653SPeter Holm 140*8a272653SPeter Holm for (i = 0; i < 1000; i++) { 141*8a272653SPeter Holm waiting = 1; 142*8a272653SPeter Holm if (pipe(fd1) == -1) 143*8a272653SPeter Holm err(1, "pipe()"); 144*8a272653SPeter Holm if (pipe(fd2) == -1) 145*8a272653SPeter Holm err(1, "pipe()"); 146*8a272653SPeter Holm if (pipe(fd3) == -1) 147*8a272653SPeter Holm err(1, "pipe()"); 148*8a272653SPeter Holm 149*8a272653SPeter Holm if ((r = pthread_mutex_init(&mutex, 0)) != 0) 150*8a272653SPeter Holm errc(1, r, "pthread_mutex_init"); 151*8a272653SPeter Holm if ((r = pthread_cond_init(&cond, NULL)) != 0) 152*8a272653SPeter Holm errc(1, r, "pthread_cond_init"); 153*8a272653SPeter Holm 154*8a272653SPeter Holm if ((r = pthread_create(&threads[0], NULL, thr1, 0)) != 0) 155*8a272653SPeter Holm errc(1, r, "pthread_create()"); 156*8a272653SPeter Holm if ((r = pthread_create(&threads[1], NULL, thr2, 0)) != 0) 157*8a272653SPeter Holm errc(1, r, "pthread_create()"); 158*8a272653SPeter Holm 159*8a272653SPeter Holm if ((r = pthread_join(threads[0], NULL)) != 0) 160*8a272653SPeter Holm errc(1, r, "pthread_join(%d)", 0); 161*8a272653SPeter Holm if ((r = pthread_join(threads[1], NULL)) != 0) 162*8a272653SPeter Holm errc(1, r, "pthread_join(%d)", 1); 163*8a272653SPeter Holm if ((r = pthread_mutex_destroy(&mutex)) != 0) 164*8a272653SPeter Holm errc(1, r, "pthread_mutex_destroy"); 165*8a272653SPeter Holm if ((r = pthread_cond_destroy(&cond)) != 0) 166*8a272653SPeter Holm errc(1, r, "pthread_condattr_destroy"); 167*8a272653SPeter Holm } 168*8a272653SPeter Holm 169*8a272653SPeter Holm return (0); 170*8a272653SPeter Holm} 171