1 /* sched.c - SPU scheduler.
3 * Copyright (C) IBM 2005
4 * Author: Mark Nutter <mnutter@us.ibm.com>
6 * 2006-03-31 NUMA domains added.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2, or (at your option)
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 #include <linux/module.h>
26 #include <linux/errno.h>
27 #include <linux/sched.h>
28 #include <linux/kernel.h>
30 #include <linux/completion.h>
31 #include <linux/vmalloc.h>
32 #include <linux/smp.h>
33 #include <linux/stddef.h>
34 #include <linux/unistd.h>
35 #include <linux/numa.h>
36 #include <linux/mutex.h>
37 #include <linux/notifier.h>
38 #include <linux/kthread.h>
39 #include <linux/pid_namespace.h>
40 #include <linux/proc_fs.h>
41 #include <linux/seq_file.h>
44 #include <asm/mmu_context.h>
46 #include <asm/spu_csa.h>
47 #include <asm/spu_priv1.h>
50 struct spu_prio_array
{
51 DECLARE_BITMAP(bitmap
, MAX_PRIO
);
52 struct list_head runq
[MAX_PRIO
];
57 static unsigned long spu_avenrun
[3];
58 static struct spu_prio_array
*spu_prio
;
59 static struct task_struct
*spusched_task
;
60 static struct timer_list spusched_timer
;
63 * Priority of a normal, non-rt, non-niced'd process (aka nice level 0).
65 #define NORMAL_PRIO 120
68 * Frequency of the spu scheduler tick. By default we do one SPU scheduler
69 * tick for every 10 CPU scheduler ticks.
71 #define SPUSCHED_TICK (10)
74 * These are the 'tuning knobs' of the scheduler:
76 * Minimum timeslice is 5 msecs (or 1 spu scheduler tick, whichever is
77 * larger), default timeslice is 100 msecs, maximum timeslice is 800 msecs.
79 #define MIN_SPU_TIMESLICE max(5 * HZ / (1000 * SPUSCHED_TICK), 1)
80 #define DEF_SPU_TIMESLICE (100 * HZ / (1000 * SPUSCHED_TICK))
82 #define MAX_USER_PRIO (MAX_PRIO - MAX_RT_PRIO)
83 #define SCALE_PRIO(x, prio) \
84 max(x * (MAX_PRIO - prio) / (MAX_USER_PRIO / 2), MIN_SPU_TIMESLICE)
87 * scale user-nice values [ -20 ... 0 ... 19 ] to time slice values:
88 * [800ms ... 100ms ... 5ms]
90 * The higher a thread's priority, the bigger timeslices
91 * it gets during one round of execution. But even the lowest
92 * priority thread gets MIN_TIMESLICE worth of execution time.
94 void spu_set_timeslice(struct spu_context
*ctx
)
96 if (ctx
->prio
< NORMAL_PRIO
)
97 ctx
->time_slice
= SCALE_PRIO(DEF_SPU_TIMESLICE
* 4, ctx
->prio
);
99 ctx
->time_slice
= SCALE_PRIO(DEF_SPU_TIMESLICE
, ctx
->prio
);
103 * Update scheduling information from the owning thread.
105 void __spu_update_sched_info(struct spu_context
*ctx
)
108 * 32-Bit assignment are atomic on powerpc, and we don't care about
109 * memory ordering here because retriving the controlling thread is
110 * per defintion racy.
112 ctx
->tid
= current
->pid
;
115 * We do our own priority calculations, so we normally want
116 * ->static_prio to start with. Unfortunately thies field
117 * contains junk for threads with a realtime scheduling
118 * policy so we have to look at ->prio in this case.
120 if (rt_prio(current
->prio
))
121 ctx
->prio
= current
->prio
;
123 ctx
->prio
= current
->static_prio
;
124 ctx
->policy
= current
->policy
;
127 * A lot of places that don't hold list_mutex poke into
128 * cpus_allowed, including grab_runnable_context which
129 * already holds the runq_lock. So abuse runq_lock
130 * to protect this field aswell.
132 spin_lock(&spu_prio
->runq_lock
);
133 ctx
->cpus_allowed
= current
->cpus_allowed
;
134 spin_unlock(&spu_prio
->runq_lock
);
137 void spu_update_sched_info(struct spu_context
*ctx
)
139 int node
= ctx
->spu
->node
;
141 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
142 __spu_update_sched_info(ctx
);
143 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
146 static int __node_allowed(struct spu_context
*ctx
, int node
)
148 if (nr_cpus_node(node
)) {
149 cpumask_t mask
= node_to_cpumask(node
);
151 if (cpus_intersects(mask
, ctx
->cpus_allowed
))
158 static int node_allowed(struct spu_context
*ctx
, int node
)
162 spin_lock(&spu_prio
->runq_lock
);
163 rval
= __node_allowed(ctx
, node
);
164 spin_unlock(&spu_prio
->runq_lock
);
169 static BLOCKING_NOTIFIER_HEAD(spu_switch_notifier
);
171 void spu_switch_notify(struct spu
*spu
, struct spu_context
*ctx
)
173 blocking_notifier_call_chain(&spu_switch_notifier
,
174 ctx
? ctx
->object_id
: 0, spu
);
177 static void notify_spus_active(void)
182 * Wake up the active spu_contexts.
184 * When the awakened processes see their "notify_active" flag is set,
185 * they will call spu_switch_notify();
187 for_each_online_node(node
) {
190 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
191 list_for_each_entry(spu
, &cbe_spu_info
[node
].spus
, cbe_list
) {
192 if (spu
->alloc_state
!= SPU_FREE
) {
193 struct spu_context
*ctx
= spu
->ctx
;
194 set_bit(SPU_SCHED_NOTIFY_ACTIVE
,
197 wake_up_all(&ctx
->stop_wq
);
200 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
204 int spu_switch_event_register(struct notifier_block
* n
)
207 ret
= blocking_notifier_chain_register(&spu_switch_notifier
, n
);
209 notify_spus_active();
212 EXPORT_SYMBOL_GPL(spu_switch_event_register
);
214 int spu_switch_event_unregister(struct notifier_block
* n
)
216 return blocking_notifier_chain_unregister(&spu_switch_notifier
, n
);
218 EXPORT_SYMBOL_GPL(spu_switch_event_unregister
);
221 * spu_bind_context - bind spu context to physical spu
222 * @spu: physical spu to bind to
223 * @ctx: context to bind
225 static void spu_bind_context(struct spu
*spu
, struct spu_context
*ctx
)
227 pr_debug("%s: pid=%d SPU=%d NODE=%d\n", __FUNCTION__
, current
->pid
,
228 spu
->number
, spu
->node
);
229 spuctx_switch_state(ctx
, SPU_UTIL_SYSTEM
);
231 if (ctx
->flags
& SPU_CREATE_NOSCHED
)
232 atomic_inc(&cbe_spu_info
[spu
->node
].reserved_spus
);
233 if (!list_empty(&ctx
->aff_list
))
234 atomic_inc(&ctx
->gang
->aff_sched_count
);
236 ctx
->stats
.slb_flt_base
= spu
->stats
.slb_flt
;
237 ctx
->stats
.class2_intr_base
= spu
->stats
.class2_intr
;
242 ctx
->ops
= &spu_hw_ops
;
243 spu
->pid
= current
->pid
;
244 spu
->tgid
= current
->tgid
;
245 spu_associate_mm(spu
, ctx
->owner
);
246 spu
->ibox_callback
= spufs_ibox_callback
;
247 spu
->wbox_callback
= spufs_wbox_callback
;
248 spu
->stop_callback
= spufs_stop_callback
;
249 spu
->mfc_callback
= spufs_mfc_callback
;
250 spu
->dma_callback
= spufs_dma_callback
;
252 spu_unmap_mappings(ctx
);
253 spu_restore(&ctx
->csa
, spu
);
254 spu
->timestamp
= jiffies
;
255 spu_cpu_affinity_set(spu
, raw_smp_processor_id());
256 spu_switch_notify(spu
, ctx
);
257 ctx
->state
= SPU_STATE_RUNNABLE
;
259 spuctx_switch_state(ctx
, SPU_UTIL_IDLE_LOADED
);
263 * Must be used with the list_mutex held.
265 static inline int sched_spu(struct spu
*spu
)
267 BUG_ON(!mutex_is_locked(&cbe_spu_info
[spu
->node
].list_mutex
));
269 return (!spu
->ctx
|| !(spu
->ctx
->flags
& SPU_CREATE_NOSCHED
));
272 static void aff_merge_remaining_ctxs(struct spu_gang
*gang
)
274 struct spu_context
*ctx
;
276 list_for_each_entry(ctx
, &gang
->aff_list_head
, aff_list
) {
277 if (list_empty(&ctx
->aff_list
))
278 list_add(&ctx
->aff_list
, &gang
->aff_list_head
);
280 gang
->aff_flags
|= AFF_MERGED
;
283 static void aff_set_offsets(struct spu_gang
*gang
)
285 struct spu_context
*ctx
;
289 list_for_each_entry_reverse(ctx
, &gang
->aff_ref_ctx
->aff_list
,
291 if (&ctx
->aff_list
== &gang
->aff_list_head
)
293 ctx
->aff_offset
= offset
--;
297 list_for_each_entry(ctx
, gang
->aff_ref_ctx
->aff_list
.prev
, aff_list
) {
298 if (&ctx
->aff_list
== &gang
->aff_list_head
)
300 ctx
->aff_offset
= offset
++;
303 gang
->aff_flags
|= AFF_OFFSETS_SET
;
306 static struct spu
*aff_ref_location(struct spu_context
*ctx
, int mem_aff
,
307 int group_size
, int lowest_offset
)
313 * TODO: A better algorithm could be used to find a good spu to be
314 * used as reference location for the ctxs chain.
316 node
= cpu_to_node(raw_smp_processor_id());
317 for (n
= 0; n
< MAX_NUMNODES
; n
++, node
++) {
318 node
= (node
< MAX_NUMNODES
) ? node
: 0;
319 if (!node_allowed(ctx
, node
))
321 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
322 list_for_each_entry(spu
, &cbe_spu_info
[node
].spus
, cbe_list
) {
323 if ((!mem_aff
|| spu
->has_mem_affinity
) &&
325 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
329 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
334 static void aff_set_ref_point_location(struct spu_gang
*gang
)
336 int mem_aff
, gs
, lowest_offset
;
337 struct spu_context
*ctx
;
340 mem_aff
= gang
->aff_ref_ctx
->flags
& SPU_CREATE_AFFINITY_MEM
;
344 list_for_each_entry(tmp
, &gang
->aff_list_head
, aff_list
)
347 list_for_each_entry_reverse(ctx
, &gang
->aff_ref_ctx
->aff_list
,
349 if (&ctx
->aff_list
== &gang
->aff_list_head
)
351 lowest_offset
= ctx
->aff_offset
;
354 gang
->aff_ref_spu
= aff_ref_location(gang
->aff_ref_ctx
, mem_aff
, gs
,
358 static struct spu
*ctx_location(struct spu
*ref
, int offset
, int node
)
364 list_for_each_entry(spu
, ref
->aff_list
.prev
, aff_list
) {
365 BUG_ON(spu
->node
!= node
);
372 list_for_each_entry_reverse(spu
, ref
->aff_list
.next
, aff_list
) {
373 BUG_ON(spu
->node
!= node
);
385 * affinity_check is called each time a context is going to be scheduled.
386 * It returns the spu ptr on which the context must run.
388 static int has_affinity(struct spu_context
*ctx
)
390 struct spu_gang
*gang
= ctx
->gang
;
392 if (list_empty(&ctx
->aff_list
))
395 mutex_lock(&gang
->aff_mutex
);
396 if (!gang
->aff_ref_spu
) {
397 if (!(gang
->aff_flags
& AFF_MERGED
))
398 aff_merge_remaining_ctxs(gang
);
399 if (!(gang
->aff_flags
& AFF_OFFSETS_SET
))
400 aff_set_offsets(gang
);
401 aff_set_ref_point_location(gang
);
403 mutex_unlock(&gang
->aff_mutex
);
405 return gang
->aff_ref_spu
!= NULL
;
409 * spu_unbind_context - unbind spu context from physical spu
410 * @spu: physical spu to unbind from
411 * @ctx: context to unbind
413 static void spu_unbind_context(struct spu
*spu
, struct spu_context
*ctx
)
415 pr_debug("%s: unbind pid=%d SPU=%d NODE=%d\n", __FUNCTION__
,
416 spu
->pid
, spu
->number
, spu
->node
);
417 spuctx_switch_state(ctx
, SPU_UTIL_SYSTEM
);
419 if (spu
->ctx
->flags
& SPU_CREATE_NOSCHED
)
420 atomic_dec(&cbe_spu_info
[spu
->node
].reserved_spus
);
421 if (!list_empty(&ctx
->aff_list
))
422 if (atomic_dec_and_test(&ctx
->gang
->aff_sched_count
))
423 ctx
->gang
->aff_ref_spu
= NULL
;
424 spu_switch_notify(spu
, NULL
);
425 spu_unmap_mappings(ctx
);
426 spu_save(&ctx
->csa
, spu
);
427 spu
->timestamp
= jiffies
;
428 ctx
->state
= SPU_STATE_SAVED
;
429 spu
->ibox_callback
= NULL
;
430 spu
->wbox_callback
= NULL
;
431 spu
->stop_callback
= NULL
;
432 spu
->mfc_callback
= NULL
;
433 spu
->dma_callback
= NULL
;
434 spu_associate_mm(spu
, NULL
);
437 ctx
->ops
= &spu_backing_ops
;
441 ctx
->stats
.slb_flt
+=
442 (spu
->stats
.slb_flt
- ctx
->stats
.slb_flt_base
);
443 ctx
->stats
.class2_intr
+=
444 (spu
->stats
.class2_intr
- ctx
->stats
.class2_intr_base
);
446 /* This maps the underlying spu state to idle */
447 spuctx_switch_state(ctx
, SPU_UTIL_IDLE_LOADED
);
452 * spu_add_to_rq - add a context to the runqueue
453 * @ctx: context to add
455 static void __spu_add_to_rq(struct spu_context
*ctx
)
458 * Unfortunately this code path can be called from multiple threads
459 * on behalf of a single context due to the way the problem state
460 * mmap support works.
462 * Fortunately we need to wake up all these threads at the same time
463 * and can simply skip the runqueue addition for every but the first
464 * thread getting into this codepath.
466 * It's still quite hacky, and long-term we should proxy all other
467 * threads through the owner thread so that spu_run is in control
468 * of all the scheduling activity for a given context.
470 if (list_empty(&ctx
->rq
)) {
471 list_add_tail(&ctx
->rq
, &spu_prio
->runq
[ctx
->prio
]);
472 set_bit(ctx
->prio
, spu_prio
->bitmap
);
473 if (!spu_prio
->nr_waiting
++)
474 __mod_timer(&spusched_timer
, jiffies
+ SPUSCHED_TICK
);
478 static void __spu_del_from_rq(struct spu_context
*ctx
)
480 int prio
= ctx
->prio
;
482 if (!list_empty(&ctx
->rq
)) {
483 if (!--spu_prio
->nr_waiting
)
484 del_timer(&spusched_timer
);
485 list_del_init(&ctx
->rq
);
487 if (list_empty(&spu_prio
->runq
[prio
]))
488 clear_bit(prio
, spu_prio
->bitmap
);
492 static void spu_prio_wait(struct spu_context
*ctx
)
496 spin_lock(&spu_prio
->runq_lock
);
497 prepare_to_wait_exclusive(&ctx
->stop_wq
, &wait
, TASK_INTERRUPTIBLE
);
498 if (!signal_pending(current
)) {
499 __spu_add_to_rq(ctx
);
500 spin_unlock(&spu_prio
->runq_lock
);
501 mutex_unlock(&ctx
->state_mutex
);
503 mutex_lock(&ctx
->state_mutex
);
504 spin_lock(&spu_prio
->runq_lock
);
505 __spu_del_from_rq(ctx
);
507 spin_unlock(&spu_prio
->runq_lock
);
508 __set_current_state(TASK_RUNNING
);
509 remove_wait_queue(&ctx
->stop_wq
, &wait
);
512 static struct spu
*spu_get_idle(struct spu_context
*ctx
)
517 if (has_affinity(ctx
)) {
518 node
= ctx
->gang
->aff_ref_spu
->node
;
520 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
521 spu
= ctx_location(ctx
->gang
->aff_ref_spu
, ctx
->aff_offset
, node
);
522 if (spu
&& spu
->alloc_state
== SPU_FREE
)
524 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
528 node
= cpu_to_node(raw_smp_processor_id());
529 for (n
= 0; n
< MAX_NUMNODES
; n
++, node
++) {
530 node
= (node
< MAX_NUMNODES
) ? node
: 0;
531 if (!node_allowed(ctx
, node
))
534 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
535 list_for_each_entry(spu
, &cbe_spu_info
[node
].spus
, cbe_list
) {
536 if (spu
->alloc_state
== SPU_FREE
)
539 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
545 spu
->alloc_state
= SPU_USED
;
546 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
547 pr_debug("Got SPU %d %d\n", spu
->number
, spu
->node
);
548 spu_init_channels(spu
);
553 * find_victim - find a lower priority context to preempt
554 * @ctx: canidate context for running
556 * Returns the freed physical spu to run the new context on.
558 static struct spu
*find_victim(struct spu_context
*ctx
)
560 struct spu_context
*victim
= NULL
;
565 * Look for a possible preemption candidate on the local node first.
566 * If there is no candidate look at the other nodes. This isn't
567 * exactly fair, but so far the whole spu schedule tries to keep
568 * a strong node affinity. We might want to fine-tune this in
572 node
= cpu_to_node(raw_smp_processor_id());
573 for (n
= 0; n
< MAX_NUMNODES
; n
++, node
++) {
574 node
= (node
< MAX_NUMNODES
) ? node
: 0;
575 if (!node_allowed(ctx
, node
))
578 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
579 list_for_each_entry(spu
, &cbe_spu_info
[node
].spus
, cbe_list
) {
580 struct spu_context
*tmp
= spu
->ctx
;
582 if (tmp
->prio
> ctx
->prio
&&
583 (!victim
|| tmp
->prio
> victim
->prio
))
586 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
590 * This nests ctx->state_mutex, but we always lock
591 * higher priority contexts before lower priority
592 * ones, so this is safe until we introduce
593 * priority inheritance schemes.
595 if (!mutex_trylock(&victim
->state_mutex
)) {
603 * This race can happen because we've dropped
604 * the active list mutex. No a problem, just
605 * restart the search.
607 mutex_unlock(&victim
->state_mutex
);
612 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
613 cbe_spu_info
[node
].nr_active
--;
614 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
616 spu_unbind_context(spu
, victim
);
617 victim
->stats
.invol_ctx_switch
++;
618 spu
->stats
.invol_ctx_switch
++;
619 mutex_unlock(&victim
->state_mutex
);
621 * We need to break out of the wait loop in spu_run
622 * manually to ensure this context gets put on the
623 * runqueue again ASAP.
625 wake_up(&victim
->stop_wq
);
634 * spu_activate - find a free spu for a context and execute it
635 * @ctx: spu context to schedule
636 * @flags: flags (currently ignored)
638 * Tries to find a free spu to run @ctx. If no free spu is available
639 * add the context to the runqueue so it gets woken up once an spu
642 int spu_activate(struct spu_context
*ctx
, unsigned long flags
)
648 * If there are multiple threads waiting for a single context
649 * only one actually binds the context while the others will
650 * only be able to acquire the state_mutex once the context
651 * already is in runnable state.
656 spu
= spu_get_idle(ctx
);
658 * If this is a realtime thread we try to get it running by
659 * preempting a lower priority thread.
661 if (!spu
&& rt_prio(ctx
->prio
))
662 spu
= find_victim(ctx
);
664 int node
= spu
->node
;
666 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
667 spu_bind_context(spu
, ctx
);
668 cbe_spu_info
[node
].nr_active
++;
669 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
674 } while (!signal_pending(current
));
680 * grab_runnable_context - try to find a runnable context
682 * Remove the highest priority context on the runqueue and return it
683 * to the caller. Returns %NULL if no runnable context was found.
685 static struct spu_context
*grab_runnable_context(int prio
, int node
)
687 struct spu_context
*ctx
;
690 spin_lock(&spu_prio
->runq_lock
);
691 best
= find_first_bit(spu_prio
->bitmap
, prio
);
692 while (best
< prio
) {
693 struct list_head
*rq
= &spu_prio
->runq
[best
];
695 list_for_each_entry(ctx
, rq
, rq
) {
696 /* XXX(hch): check for affinity here aswell */
697 if (__node_allowed(ctx
, node
)) {
698 __spu_del_from_rq(ctx
);
706 spin_unlock(&spu_prio
->runq_lock
);
710 static int __spu_deactivate(struct spu_context
*ctx
, int force
, int max_prio
)
712 struct spu
*spu
= ctx
->spu
;
713 struct spu_context
*new = NULL
;
716 new = grab_runnable_context(max_prio
, spu
->node
);
718 int node
= spu
->node
;
720 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
721 spu_unbind_context(spu
, ctx
);
722 spu
->alloc_state
= SPU_FREE
;
723 cbe_spu_info
[node
].nr_active
--;
724 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
726 ctx
->stats
.vol_ctx_switch
++;
727 spu
->stats
.vol_ctx_switch
++;
730 wake_up(&new->stop_wq
);
739 * spu_deactivate - unbind a context from it's physical spu
740 * @ctx: spu context to unbind
742 * Unbind @ctx from the physical spu it is running on and schedule
743 * the highest priority context to run on the freed physical spu.
745 void spu_deactivate(struct spu_context
*ctx
)
747 __spu_deactivate(ctx
, 1, MAX_PRIO
);
751 * spu_yield - yield a physical spu if others are waiting
752 * @ctx: spu context to yield
754 * Check if there is a higher priority context waiting and if yes
755 * unbind @ctx from the physical spu and schedule the highest
756 * priority context to run on the freed physical spu instead.
758 void spu_yield(struct spu_context
*ctx
)
760 if (!(ctx
->flags
& SPU_CREATE_NOSCHED
)) {
761 mutex_lock(&ctx
->state_mutex
);
762 __spu_deactivate(ctx
, 0, MAX_PRIO
);
763 mutex_unlock(&ctx
->state_mutex
);
767 static noinline
void spusched_tick(struct spu_context
*ctx
)
769 if (ctx
->flags
& SPU_CREATE_NOSCHED
)
771 if (ctx
->policy
== SCHED_FIFO
)
774 if (--ctx
->time_slice
)
778 * Unfortunately list_mutex ranks outside of state_mutex, so
779 * we have to trylock here. If we fail give the context another
780 * tick and try again.
782 if (mutex_trylock(&ctx
->state_mutex
)) {
783 struct spu
*spu
= ctx
->spu
;
784 struct spu_context
*new;
786 new = grab_runnable_context(ctx
->prio
+ 1, spu
->node
);
788 spu_unbind_context(spu
, ctx
);
789 ctx
->stats
.invol_ctx_switch
++;
790 spu
->stats
.invol_ctx_switch
++;
791 spu
->alloc_state
= SPU_FREE
;
792 cbe_spu_info
[spu
->node
].nr_active
--;
793 wake_up(&new->stop_wq
);
795 * We need to break out of the wait loop in
796 * spu_run manually to ensure this context
797 * gets put on the runqueue again ASAP.
799 wake_up(&ctx
->stop_wq
);
801 spu_set_timeslice(ctx
);
802 mutex_unlock(&ctx
->state_mutex
);
809 * count_active_contexts - count nr of active tasks
811 * Return the number of tasks currently running or waiting to run.
813 * Note that we don't take runq_lock / list_mutex here. Reading
814 * a single 32bit value is atomic on powerpc, and we don't care
815 * about memory ordering issues here.
817 static unsigned long count_active_contexts(void)
819 int nr_active
= 0, node
;
821 for (node
= 0; node
< MAX_NUMNODES
; node
++)
822 nr_active
+= cbe_spu_info
[node
].nr_active
;
823 nr_active
+= spu_prio
->nr_waiting
;
829 * spu_calc_load - given tick count, update the avenrun load estimates.
832 * No locking against reading these values from userspace, as for
833 * the CPU loadavg code.
835 static void spu_calc_load(unsigned long ticks
)
837 unsigned long active_tasks
; /* fixed-point */
838 static int count
= LOAD_FREQ
;
842 if (unlikely(count
< 0)) {
843 active_tasks
= count_active_contexts() * FIXED_1
;
845 CALC_LOAD(spu_avenrun
[0], EXP_1
, active_tasks
);
846 CALC_LOAD(spu_avenrun
[1], EXP_5
, active_tasks
);
847 CALC_LOAD(spu_avenrun
[2], EXP_15
, active_tasks
);
853 static void spusched_wake(unsigned long data
)
855 mod_timer(&spusched_timer
, jiffies
+ SPUSCHED_TICK
);
856 wake_up_process(spusched_task
);
857 spu_calc_load(SPUSCHED_TICK
);
860 static int spusched_thread(void *unused
)
865 while (!kthread_should_stop()) {
866 set_current_state(TASK_INTERRUPTIBLE
);
868 for (node
= 0; node
< MAX_NUMNODES
; node
++) {
869 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
870 list_for_each_entry(spu
, &cbe_spu_info
[node
].spus
, cbe_list
)
872 spusched_tick(spu
->ctx
);
873 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);
880 #define LOAD_INT(x) ((x) >> FSHIFT)
881 #define LOAD_FRAC(x) LOAD_INT(((x) & (FIXED_1-1)) * 100)
883 static int show_spu_loadavg(struct seq_file
*s
, void *private)
887 a
= spu_avenrun
[0] + (FIXED_1
/200);
888 b
= spu_avenrun
[1] + (FIXED_1
/200);
889 c
= spu_avenrun
[2] + (FIXED_1
/200);
892 * Note that last_pid doesn't really make much sense for the
893 * SPU loadavg (it even seems very odd on the CPU side..),
894 * but we include it here to have a 100% compatible interface.
896 seq_printf(s
, "%d.%02d %d.%02d %d.%02d %ld/%d %d\n",
897 LOAD_INT(a
), LOAD_FRAC(a
),
898 LOAD_INT(b
), LOAD_FRAC(b
),
899 LOAD_INT(c
), LOAD_FRAC(c
),
900 count_active_contexts(),
901 atomic_read(&nr_spu_contexts
),
902 current
->nsproxy
->pid_ns
->last_pid
);
906 static int spu_loadavg_open(struct inode
*inode
, struct file
*file
)
908 return single_open(file
, show_spu_loadavg
, NULL
);
911 static const struct file_operations spu_loadavg_fops
= {
912 .open
= spu_loadavg_open
,
915 .release
= single_release
,
918 int __init
spu_sched_init(void)
920 struct proc_dir_entry
*entry
;
921 int err
= -ENOMEM
, i
;
923 spu_prio
= kzalloc(sizeof(struct spu_prio_array
), GFP_KERNEL
);
927 for (i
= 0; i
< MAX_PRIO
; i
++) {
928 INIT_LIST_HEAD(&spu_prio
->runq
[i
]);
929 __clear_bit(i
, spu_prio
->bitmap
);
931 spin_lock_init(&spu_prio
->runq_lock
);
933 setup_timer(&spusched_timer
, spusched_wake
, 0);
935 spusched_task
= kthread_run(spusched_thread
, NULL
, "spusched");
936 if (IS_ERR(spusched_task
)) {
937 err
= PTR_ERR(spusched_task
);
938 goto out_free_spu_prio
;
941 entry
= create_proc_entry("spu_loadavg", 0, NULL
);
943 goto out_stop_kthread
;
944 entry
->proc_fops
= &spu_loadavg_fops
;
946 pr_debug("spusched: tick: %d, min ticks: %d, default ticks: %d\n",
947 SPUSCHED_TICK
, MIN_SPU_TIMESLICE
, DEF_SPU_TIMESLICE
);
951 kthread_stop(spusched_task
);
958 void spu_sched_exit(void)
963 remove_proc_entry("spu_loadavg", NULL
);
965 del_timer_sync(&spusched_timer
);
966 kthread_stop(spusched_task
);
968 for (node
= 0; node
< MAX_NUMNODES
; node
++) {
969 mutex_lock(&cbe_spu_info
[node
].list_mutex
);
970 list_for_each_entry(spu
, &cbe_spu_info
[node
].spus
, cbe_list
)
971 if (spu
->alloc_state
!= SPU_FREE
)
972 spu
->alloc_state
= SPU_FREE
;
973 mutex_unlock(&cbe_spu_info
[node
].list_mutex
);