| [1] | 1 | /* Copyright (c) 2007-2009, Stanford University |
|---|
| 2 | * All rights reserved. |
|---|
| 3 | * |
|---|
| 4 | * Redistribution and use in source and binary forms, with or without |
|---|
| 5 | * modification, are permitted provided that the following conditions are met: |
|---|
| 6 | * * Redistributions of source code must retain the above copyright |
|---|
| 7 | * notice, this list of conditions and the following disclaimer. |
|---|
| 8 | * * Redistributions in binary form must reproduce the above copyright |
|---|
| 9 | * notice, this list of conditions and the following disclaimer in the |
|---|
| 10 | * documentation and/or other materials provided with the distribution. |
|---|
| 11 | * * Neither the name of Stanford University nor the names of its |
|---|
| 12 | * contributors may be used to endorse or promote products derived from |
|---|
| 13 | * this software without specific prior written permission. |
|---|
| 14 | * |
|---|
| 15 | * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY |
|---|
| 16 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|---|
| 17 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|---|
| 18 | * DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE FOR ANY |
|---|
| 19 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|---|
| 20 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
|---|
| 21 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
|---|
| 22 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|---|
| 23 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|---|
| 24 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|---|
| 25 | */ |
|---|
| 26 | |
|---|
| 27 | #ifndef TASK_Q_ |
|---|
| 28 | #define TASK_Q_ |
|---|
| 29 | |
|---|
| 30 | #include <stdint.h> |
|---|
| 31 | |
|---|
| 32 | typedef struct { |
|---|
| 33 | union { |
|---|
| 34 | uint32_t v[4]; |
|---|
| 35 | struct { |
|---|
| 36 | uint32_t id; |
|---|
| 37 | uint32_t len; |
|---|
| 38 | uint32_t data; |
|---|
| 39 | uint32_t pad; |
|---|
| 40 | }; |
|---|
| 41 | }; |
|---|
| 42 | } task_t; |
|---|
| 43 | |
|---|
| 44 | struct taskQ_t; |
|---|
| 45 | typedef struct taskQ_t taskQ_t; |
|---|
| 46 | |
|---|
| 47 | int tq_enqueue (taskQ_t* tq, task_t *task, int lgrp, int tid); |
|---|
| 48 | int tq_enqueue_seq (taskQ_t* tq, task_t *task, int lgrp); |
|---|
| 49 | int tq_dequeue (taskQ_t* tq, task_t *task, int lgrp, int tid); |
|---|
| 50 | taskQ_t* tq_init (int num_threads); |
|---|
| 51 | void tq_reset (taskQ_t* tq, int num_threads); |
|---|
| 52 | void tq_finalize (taskQ_t* tq); |
|---|
| 53 | |
|---|
| 54 | #endif /* TASK_Q_ */ |
|---|
