| 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 | #include <assert.h> |
|---|
| 28 | |
|---|
| 29 | #include "scheduler.h" |
|---|
| 30 | #include "locality.h" |
|---|
| 31 | #include "processor.h" |
|---|
| 32 | |
|---|
| 33 | static int map_fill_strand(sched_policy* sp, int thr); |
|---|
| 34 | static int map_fill_core(sched_policy* sp, int thr); |
|---|
| 35 | static int map_fill_chip(sched_policy* sp, int thr); |
|---|
| 36 | |
|---|
| 37 | struct sched_policy |
|---|
| 38 | { |
|---|
| 39 | int num_cpus; |
|---|
| 40 | int num_chips_per_sys; |
|---|
| 41 | int (*map)(sched_policy* sp, int thr_idx); |
|---|
| 42 | }; |
|---|
| 43 | |
|---|
| 44 | struct sched_policy policies[SCHED_POLICY_LAST + 1] = { |
|---|
| 45 | { .map = map_fill_strand }, |
|---|
| 46 | { .map = map_fill_core }, |
|---|
| 47 | { .map = map_fill_chip }, |
|---|
| 48 | }; |
|---|
| 49 | |
|---|
| 50 | sched_policy* sched_policy_get(unsigned int policy) |
|---|
| 51 | { |
|---|
| 52 | assert (policy <= SCHED_POLICY_LAST); |
|---|
| 53 | /* XXX make this configurable */ |
|---|
| 54 | policies[policy].num_cpus = proc_get_num_cpus(); |
|---|
| 55 | policies[policy].num_chips_per_sys = loc_get_num_lgrps (); |
|---|
| 56 | return &policies[policy]; |
|---|
| 57 | } |
|---|
| 58 | |
|---|
| 59 | void sched_policy_put(sched_policy* sp) |
|---|
| 60 | { |
|---|
| 61 | /* STUB */ |
|---|
| 62 | } |
|---|
| 63 | |
|---|
| 64 | /** |
|---|
| 65 | * Given a thread index, gives the cpu it should be assigned to. |
|---|
| 66 | */ |
|---|
| 67 | int sched_thr_to_cpu(sched_policy* sp, int thr) |
|---|
| 68 | { |
|---|
| 69 | return sp->map(sp, thr); |
|---|
| 70 | } |
|---|
| 71 | |
|---|
| 72 | static int map_fill_strand(sched_policy* sp, int thr) |
|---|
| 73 | { |
|---|
| 74 | int num_cpus = sp->num_cpus; |
|---|
| 75 | return (thr % num_cpus); |
|---|
| 76 | } |
|---|
| 77 | |
|---|
| 78 | static int map_fill_core(sched_policy* sp, int thr) |
|---|
| 79 | { |
|---|
| 80 | int num_cpus = sp->num_cpus; |
|---|
| 81 | |
|---|
| 82 | return thr % num_cpus; |
|---|
| 83 | } |
|---|
| 84 | |
|---|
| 85 | static int map_fill_chip(sched_policy* sp, int thr) |
|---|
| 86 | { |
|---|
| 87 | int num_cpus = sp->num_cpus; |
|---|
| 88 | |
|---|
| 89 | return thr % num_cpus; |
|---|
| 90 | } |
|---|