Home | History | Annotate | Line # | Download | only in linux
completion.h revision 1.5.4.1
      1  1.5.4.1  pgoyette /*	$NetBSD: completion.h,v 1.5.4.1 2017/03/20 06:57:44 pgoyette Exp $	*/
      2      1.1  riastrad 
      3      1.1  riastrad /*-
      4      1.1  riastrad  * Copyright (c) 2013 The NetBSD Foundation, Inc.
      5      1.1  riastrad  * All rights reserved.
      6      1.1  riastrad  *
      7      1.1  riastrad  * This code is derived from software contributed to The NetBSD Foundation
      8      1.1  riastrad  * by Taylor R. Campbell.
      9      1.1  riastrad  *
     10      1.1  riastrad  * Redistribution and use in source and binary forms, with or without
     11      1.1  riastrad  * modification, are permitted provided that the following conditions
     12      1.1  riastrad  * are met:
     13      1.1  riastrad  * 1. Redistributions of source code must retain the above copyright
     14      1.1  riastrad  *    notice, this list of conditions and the following disclaimer.
     15      1.1  riastrad  * 2. Redistributions in binary form must reproduce the above copyright
     16      1.1  riastrad  *    notice, this list of conditions and the following disclaimer in the
     17      1.1  riastrad  *    documentation and/or other materials provided with the distribution.
     18      1.1  riastrad  *
     19      1.1  riastrad  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20      1.1  riastrad  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21      1.1  riastrad  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22      1.1  riastrad  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23      1.1  riastrad  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24      1.1  riastrad  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25      1.1  riastrad  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26      1.1  riastrad  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27      1.1  riastrad  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28      1.1  riastrad  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29      1.1  riastrad  * POSSIBILITY OF SUCH DAMAGE.
     30      1.1  riastrad  */
     31      1.1  riastrad 
     32      1.4  riastrad /*
     33      1.4  riastrad  * Notes on porting:
     34      1.4  riastrad  *
     35      1.4  riastrad  * - Linux does not have destroy_completion.  You must add it yourself
     36      1.4  riastrad  *   in the appropriate place.
     37      1.4  riastrad  *
     38      1.4  riastrad  * - Some Linux code does `completion->done++' or similar.  Convert
     39      1.4  riastrad  *   that to complete(completion) and suggest the same change upstream,
     40      1.4  riastrad  *   unless it turns out there actually is a good reason to do that, in
     41      1.4  riastrad  *   which case the Linux completion API should be extended with a
     42      1.4  riastrad  *   sensible name for this that doesn't expose the guts of `struct
     43      1.4  riastrad  *   completion'.
     44      1.4  riastrad  */
     45      1.4  riastrad 
     46      1.1  riastrad #ifndef _LINUX_COMPLETION_H_
     47      1.1  riastrad #define _LINUX_COMPLETION_H_
     48      1.1  riastrad 
     49      1.1  riastrad #include <sys/types.h>
     50      1.1  riastrad #include <sys/condvar.h>
     51      1.1  riastrad #include <sys/mutex.h>
     52      1.1  riastrad 
     53      1.1  riastrad #include <machine/limits.h>
     54      1.1  riastrad 
     55      1.1  riastrad #include <linux/errno.h>
     56      1.1  riastrad 
     57      1.1  riastrad struct completion {
     58      1.1  riastrad 	kmutex_t	c_lock;
     59      1.1  riastrad 	kcondvar_t	c_cv;
     60      1.1  riastrad 
     61      1.1  riastrad 	/*
     62      1.1  riastrad 	 * c_done is either
     63      1.1  riastrad 	 *
     64      1.1  riastrad 	 *   . -1, meaning it's open season and we're done for good and
     65      1.1  riastrad 	 *     nobody need wait any more;
     66      1.1  riastrad 	 *
     67      1.1  riastrad 	 *   . 0, meaning nothing is done, so waiters must block; or
     68      1.1  riastrad 	 *
     69      1.1  riastrad 	 *   . a positive integer, meaning that many waiters can
     70      1.1  riastrad 	 *     proceed before further waiters must block.
     71      1.1  riastrad 	 *
     72      1.1  riastrad 	 * Negative values other than -1 are not allowed.
     73      1.1  riastrad 	 */
     74      1.1  riastrad 	int		c_done;
     75      1.1  riastrad };
     76      1.1  riastrad 
     77      1.1  riastrad /*
     78      1.1  riastrad  * Initialize a new completion object.
     79      1.1  riastrad  */
     80      1.1  riastrad static inline void
     81      1.1  riastrad init_completion(struct completion *completion)
     82      1.1  riastrad {
     83      1.1  riastrad 
     84      1.5  jmcneill 	mutex_init(&completion->c_lock, MUTEX_DEFAULT, IPL_SCHED);
     85      1.1  riastrad 	cv_init(&completion->c_cv, "lnxcmplt");
     86      1.1  riastrad 	completion->c_done = 0;
     87      1.1  riastrad }
     88      1.1  riastrad 
     89      1.1  riastrad /*
     90  1.5.4.1  pgoyette  * re-initialize a completion object.
     91  1.5.4.1  pgoyette  */
     92  1.5.4.1  pgoyette static inline void
     93  1.5.4.1  pgoyette reinit_completion(struct completion *completion)
     94  1.5.4.1  pgoyette {
     95  1.5.4.1  pgoyette 
     96  1.5.4.1  pgoyette 	completion->c_done = 0;
     97  1.5.4.1  pgoyette }
     98  1.5.4.1  pgoyette 
     99  1.5.4.1  pgoyette /*
    100      1.1  riastrad  * Destroy a completion object.
    101      1.1  riastrad  */
    102      1.1  riastrad static inline void
    103      1.1  riastrad destroy_completion(struct completion *completion)
    104      1.1  riastrad {
    105      1.1  riastrad 	KASSERT(!cv_has_waiters(&completion->c_cv));
    106      1.1  riastrad 	cv_destroy(&completion->c_cv);
    107      1.1  riastrad 	mutex_destroy(&completion->c_lock);
    108      1.1  riastrad }
    109      1.1  riastrad 
    110      1.1  riastrad /*
    111      1.1  riastrad  * Notify one waiter of completion, but not any future ones.
    112      1.1  riastrad  */
    113      1.1  riastrad static inline void
    114      1.1  riastrad complete(struct completion *completion)
    115      1.1  riastrad {
    116      1.1  riastrad 
    117      1.1  riastrad 	mutex_enter(&completion->c_lock);
    118      1.1  riastrad 
    119      1.1  riastrad 	/* If it's not open season, wake one waiter.  */
    120      1.1  riastrad 	if (completion->c_done >= 0) {
    121      1.1  riastrad 		KASSERT(completion->c_done < INT_MAX); /* XXX check */
    122      1.1  riastrad 		completion->c_done++;
    123      1.1  riastrad 		cv_signal(&completion->c_cv);
    124      1.1  riastrad 	} else {
    125      1.1  riastrad 		KASSERT(completion->c_done == -1);
    126      1.1  riastrad 	}
    127      1.1  riastrad 
    128      1.1  riastrad 	mutex_exit(&completion->c_lock);
    129      1.1  riastrad }
    130      1.1  riastrad 
    131      1.1  riastrad /*
    132      1.1  riastrad  * Notify all waiters, present and future (until INIT_COMPLETION), of
    133      1.1  riastrad  * completion.
    134      1.1  riastrad  */
    135      1.1  riastrad static inline void
    136      1.1  riastrad complete_all(struct completion *completion)
    137      1.1  riastrad {
    138      1.1  riastrad 
    139      1.1  riastrad 	mutex_enter(&completion->c_lock);
    140      1.1  riastrad 
    141      1.1  riastrad 	/* If it's not open season, make it open season and wake everyone.  */
    142      1.1  riastrad 	if (completion->c_done >= 0) {
    143      1.1  riastrad 		completion->c_done = -1;
    144      1.1  riastrad 		cv_broadcast(&completion->c_cv);
    145      1.1  riastrad 	} else {
    146      1.1  riastrad 		KASSERT(completion->c_done == -1);
    147      1.1  riastrad 	}
    148      1.1  riastrad 
    149      1.1  riastrad 	mutex_exit(&completion->c_lock);
    150      1.1  riastrad }
    151      1.1  riastrad 
    152      1.1  riastrad /*
    153      1.1  riastrad  * Reverse the effect of complete_all so that subsequent waiters block
    154      1.1  riastrad  * until someone calls complete or complete_all.
    155      1.1  riastrad  *
    156      1.1  riastrad  * This operation is very different from its lowercase counterpart.
    157      1.1  riastrad  *
    158      1.1  riastrad  * For some reason this works on the completion object itself, not on a
    159      1.1  riastrad  * pointer thereto, so it must be a macro.
    160      1.1  riastrad  */
    161      1.1  riastrad #define	INIT_COMPLETION(COMPLETION)	INIT_COMPLETION_blorp(&(COMPLETION))
    162      1.1  riastrad 
    163      1.1  riastrad static inline void
    164      1.1  riastrad INIT_COMPLETION_blorp(struct completion *completion)
    165      1.1  riastrad {
    166      1.1  riastrad 
    167      1.1  riastrad 	mutex_enter(&completion->c_lock);
    168      1.1  riastrad 	completion->c_done = 0;
    169      1.1  riastrad 	/* No notify -- waiters are interested only in nonzero values.  */
    170      1.1  riastrad 	mutex_exit(&completion->c_lock);
    171      1.1  riastrad }
    172      1.1  riastrad 
    173      1.1  riastrad static inline void
    174      1.1  riastrad _completion_claim(struct completion *completion)
    175      1.1  riastrad {
    176      1.1  riastrad 
    177      1.1  riastrad 	KASSERT(mutex_owned(&completion->c_lock));
    178      1.2  riastrad 	KASSERT(completion->c_done != 0);
    179      1.1  riastrad 	if (completion->c_done > 0)
    180      1.1  riastrad 		completion->c_done--;
    181      1.1  riastrad 	else
    182      1.1  riastrad 		KASSERT(completion->c_done == -1);
    183      1.1  riastrad }
    184      1.1  riastrad 
    185      1.1  riastrad /*
    186      1.1  riastrad  * Wait interruptibly with a timeout for someone to call complete or
    187      1.1  riastrad  * complete_all.
    188      1.1  riastrad  */
    189      1.1  riastrad static inline int
    190      1.1  riastrad wait_for_completion_interruptible_timeout(struct completion *completion,
    191      1.1  riastrad     unsigned long ticks)
    192      1.1  riastrad {
    193      1.1  riastrad 	/* XXX Arithmetic overflow...?  */
    194      1.1  riastrad 	unsigned int start = hardclock_ticks, now;
    195      1.1  riastrad 	int error;
    196      1.1  riastrad 
    197      1.1  riastrad 	mutex_enter(&completion->c_lock);
    198      1.1  riastrad 
    199      1.1  riastrad 	/* Wait until c_done is nonzero.  */
    200      1.1  riastrad 	while (completion->c_done == 0) {
    201      1.1  riastrad 		error = cv_timedwait_sig(&completion->c_cv,
    202      1.1  riastrad 		    &completion->c_lock, ticks);
    203      1.1  riastrad 		if (error)
    204      1.1  riastrad 			goto out;
    205      1.1  riastrad 		now = hardclock_ticks;
    206      1.1  riastrad 		if (ticks < (now - start)) {
    207      1.1  riastrad 			error = EWOULDBLOCK;
    208      1.1  riastrad 			goto out;
    209      1.1  riastrad 		}
    210      1.1  riastrad 		ticks -= (now - start);
    211      1.1  riastrad 		start = now;
    212      1.1  riastrad 	}
    213      1.1  riastrad 
    214      1.1  riastrad 	/* Success!  */
    215      1.1  riastrad 	_completion_claim(completion);
    216      1.1  riastrad 	error = 0;
    217      1.1  riastrad 
    218      1.1  riastrad out:	mutex_exit(&completion->c_lock);
    219      1.1  riastrad 	if (error == EWOULDBLOCK) {
    220      1.1  riastrad 		return 0;
    221      1.1  riastrad 	} else if ((error == EINTR) || (error == ERESTART)) {
    222      1.1  riastrad 		return -ERESTARTSYS;
    223      1.1  riastrad 	} else {
    224      1.1  riastrad 		KASSERTMSG((error == 0), "error = %d", error);
    225      1.1  riastrad 		return ticks;
    226      1.1  riastrad 	}
    227      1.1  riastrad }
    228      1.1  riastrad 
    229      1.1  riastrad /*
    230      1.1  riastrad  * Wait interruptibly for someone to call complete or complete_all.
    231      1.1  riastrad  */
    232      1.1  riastrad static inline int
    233      1.1  riastrad wait_for_completion_interruptible(struct completion *completion)
    234      1.1  riastrad {
    235      1.1  riastrad 	int error;
    236      1.1  riastrad 
    237      1.1  riastrad 	mutex_enter(&completion->c_lock);
    238      1.1  riastrad 
    239      1.1  riastrad 	/* Wait until c_done is nonzero.  */
    240      1.1  riastrad 	while (completion->c_done == 0) {
    241      1.1  riastrad 		error = cv_wait_sig(&completion->c_cv, &completion->c_lock);
    242      1.1  riastrad 		if (error)
    243      1.1  riastrad 			goto out;
    244      1.1  riastrad 	}
    245      1.1  riastrad 
    246      1.1  riastrad 	/* Success!  */
    247      1.1  riastrad 	_completion_claim(completion);
    248      1.1  riastrad 	error = 0;
    249      1.1  riastrad 
    250      1.1  riastrad out:	mutex_exit(&completion->c_lock);
    251      1.1  riastrad 	if ((error == EINTR) || (error == ERESTART))
    252      1.1  riastrad 		error = -ERESTARTSYS;
    253      1.1  riastrad 	return error;
    254      1.1  riastrad }
    255      1.1  riastrad 
    256      1.1  riastrad /*
    257      1.1  riastrad  * Wait uninterruptibly, except by SIGKILL, for someone to call
    258      1.1  riastrad  * complete or complete_all.
    259      1.1  riastrad  *
    260      1.1  riastrad  * XXX In this implementation, any signal will actually wake us, not
    261      1.1  riastrad  * just SIGKILL.
    262      1.1  riastrad  */
    263      1.1  riastrad static inline int
    264      1.1  riastrad wait_for_completion_killable(struct completion *completion)
    265      1.1  riastrad {
    266      1.1  riastrad 
    267      1.1  riastrad 	return wait_for_completion_interruptible(completion);
    268      1.1  riastrad }
    269      1.1  riastrad 
    270      1.1  riastrad /*
    271      1.1  riastrad  * Try to claim a completion immediately.  Return true on success, false
    272      1.1  riastrad  * if it would block.
    273      1.1  riastrad  */
    274      1.1  riastrad static inline bool
    275      1.1  riastrad try_wait_for_completion(struct completion *completion)
    276      1.1  riastrad {
    277      1.1  riastrad 	bool ok;
    278      1.1  riastrad 
    279      1.1  riastrad 	mutex_enter(&completion->c_lock);
    280      1.1  riastrad 	if (completion->c_done == 0) {
    281      1.1  riastrad 		ok = false;
    282      1.1  riastrad 	} else {
    283      1.1  riastrad 		_completion_claim(completion);
    284      1.1  riastrad 		ok = true;
    285      1.1  riastrad 	}
    286      1.1  riastrad 	mutex_exit(&completion->c_lock);
    287      1.1  riastrad 
    288      1.1  riastrad 	return ok;
    289      1.1  riastrad }
    290      1.1  riastrad 
    291      1.1  riastrad #endif	/* _LINUX_COMPLETION_H_ */
    292