| thr_priority_queue.c (50476) | thr_priority_queue.c (55194) |
|---|---|
| 1/* 2 * Copyright (c) 1998 Daniel Eischen <eischen@vigrid.com>. 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 --- 15 unchanged lines hidden (view full) --- 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 * | 1/* 2 * Copyright (c) 1998 Daniel Eischen <eischen@vigrid.com>. 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 --- 15 unchanged lines hidden (view full) --- 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/libkse/thread/thr_priority_queue.c 50476 1999-08-28 00:22:10Z peter $ | 32 * $FreeBSD: head/lib/libkse/thread/thr_priority_queue.c 55194 1999-12-28 18:13:04Z deischen $ |
| 33 */ 34#include <stdlib.h> 35#include <sys/queue.h> 36#include <string.h> 37#ifdef _THREAD_SAFE 38#include <pthread.h> 39#include "pthread_private.h" 40 --- 41 unchanged lines hidden (view full) --- 82#define _PQ_CHECK_PRIO() 83 84#endif 85 86 87int 88_pq_alloc(pq_queue_t *pq, int minprio, int maxprio) 89{ | 33 */ 34#include <stdlib.h> 35#include <sys/queue.h> 36#include <string.h> 37#ifdef _THREAD_SAFE 38#include <pthread.h> 39#include "pthread_private.h" 40 --- 41 unchanged lines hidden (view full) --- 82#define _PQ_CHECK_PRIO() 83 84#endif 85 86 87int 88_pq_alloc(pq_queue_t *pq, int minprio, int maxprio) 89{ |
| 90 int i, ret = 0; | 90 int ret = 0; |
| 91 int prioslots = maxprio - minprio + 1; 92 93 if (pq == NULL) 94 ret = -1; 95 96 /* Create the priority queue with (maxprio - minprio + 1) slots: */ 97 else if ((pq->pq_lists = 98 (pq_list_t *) malloc(sizeof(pq_list_t) * prioslots)) == NULL) --- 237 unchanged lines hidden --- | 91 int prioslots = maxprio - minprio + 1; 92 93 if (pq == NULL) 94 ret = -1; 95 96 /* Create the priority queue with (maxprio - minprio + 1) slots: */ 97 else if ((pq->pq_lists = 98 (pq_list_t *) malloc(sizeof(pq_list_t) * prioslots)) == NULL) --- 237 unchanged lines hidden --- |