| [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 SCHEDULER_H_ |
|---|
| 28 | #define SCHEDULER_H_ |
|---|
| 29 | |
|---|
| 30 | #include "defines.h" |
|---|
| 31 | |
|---|
| 32 | typedef struct sched_policy sched_policy; |
|---|
| 33 | |
|---|
| 34 | /* one per strand */ |
|---|
| 35 | #define SCHED_POLICY_STRAND_FILL 0 |
|---|
| 36 | /* one per core, one per strand */ |
|---|
| 37 | #define SCHED_POLICY_CORE_FILL 1 |
|---|
| 38 | /* one per chip, one per core, one per strand */ |
|---|
| 39 | #define SCHED_POLICY_CHIP_FILL 2 |
|---|
| 40 | #define SCHED_POLICY_LAST 2 |
|---|
| 41 | |
|---|
| 42 | sched_policy* sched_policy_get(unsigned int policy); |
|---|
| 43 | void sched_policy_put(sched_policy* sp); |
|---|
| 44 | int sched_thr_to_cpu(sched_policy* sp, int thr); |
|---|
| 45 | |
|---|
| 46 | #endif /* SCHEDULER_H_ */ |
|---|
