thr_condattr.c revision 144518
1/* 2 * Copyright (c) 1997 John Birrell <jb@cimlogic.com.au>. 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 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by John Birrell. 16 * 4. Neither the name of the author nor the names of any co-contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY JOHN BIRRELL AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 * 32 * $FreeBSD: head/lib/libthr/thread/thr_condattr.c 144518 2005-04-02 01:20:00Z davidxu $ 33 */ 34 35#include <stdlib.h> 36#include <string.h> 37#include <errno.h> 38#include <pthread.h> 39 40#include "thr_private.h" 41 42__weak_reference(_pthread_condattr_init, pthread_condattr_init); 43__weak_reference(_pthread_condattr_destroy, pthread_condattr_destroy); 44__weak_reference(_pthread_condattr_getclock, pthread_condattr_getclock); 45__weak_reference(_pthread_condattr_setclock, pthread_condattr_setclock); 46__weak_reference(_pthread_condattr_getpshared, pthread_condattr_getpshared); 47__weak_reference(_pthread_condattr_setpshared, pthread_condattr_setpshared); 48 49int 50_pthread_condattr_init(pthread_condattr_t *attr) 51{ 52 pthread_condattr_t pattr; 53 int ret; 54 55 if ((pattr = (pthread_condattr_t) 56 malloc(sizeof(struct pthread_cond_attr))) == NULL) { 57 ret = ENOMEM; 58 } else { 59 memcpy(pattr, &_pthread_condattr_default, 60 sizeof(struct pthread_cond_attr)); 61 *attr = pattr; 62 ret = 0; 63 } 64 return (ret); 65} 66 67int 68_pthread_condattr_destroy(pthread_condattr_t *attr) 69{ 70 int ret; 71 72 if (attr == NULL || *attr == NULL) { 73 ret = EINVAL; 74 } else { 75 free(*attr); 76 *attr = NULL; 77 ret = 0; 78 } 79 return(ret); 80} 81 82int 83_pthread_condattr_getclock(const pthread_condattr_t *attr, 84 clockid_t *clock_id) 85{ 86 if (attr == NULL || *attr == NULL) 87 return (EINVAL); 88 *clock_id = (*attr)->c_clockid; 89 return (0); 90} 91 92int 93_pthread_condattr_setclock(pthread_condattr_t *attr, 94 clockid_t clock_id) 95{ 96 if (attr == NULL || *attr == NULL) 97 return (EINVAL); 98 if (clock_id != CLOCK_REALTIME && 99 clock_id != CLOCK_VIRTUAL && 100 clock_id != CLOCK_PROF && 101 clock_id != CLOCK_MONOTONIC) { 102 return (EINVAL); 103 } 104 (*attr)->c_clockid = clock_id; 105 return (0); 106} 107 108int 109_pthread_condattr_getpshared(const pthread_condattr_t *attr, 110 int *pshared) 111{ 112 if (attr == NULL || *attr == NULL) 113 return (EINVAL); 114 115 pshared = PTHREAD_PROCESS_PRIVATE; 116 return (0); 117} 118 119int 120_pthread_condattr_setpshared(pthread_condattr_t *attr, int pshared) 121{ 122 if (attr == NULL || *attr == NULL) 123 return (EINVAL); 124 125 if (pshared != PTHREAD_PROCESS_PRIVATE) 126 return (EINVAL); 127 return (0); 128} 129