2 * SPU file system -- SPU context management
4 * (C) Copyright IBM Deutschland Entwicklung GmbH 2005
6 * Author: Arnd Bergmann <arndb@de.ibm.com>
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/slab.h>
27 #include <asm/atomic.h>
29 #include <asm/spu_csa.h>
33 atomic_t nr_spu_contexts = ATOMIC_INIT(0);
35 struct spu_context *alloc_spu_context(struct spu_gang *gang)
37 struct spu_context *ctx;
38 ctx = kzalloc(sizeof *ctx, GFP_KERNEL);
41 /* Binding to physical processor deferred
42 * until spu_activate().
44 if (spu_init_csa(&ctx->csa))
46 spin_lock_init(&ctx->mmio_lock);
47 mutex_init(&ctx->mapping_lock);
48 kref_init(&ctx->kref);
49 mutex_init(&ctx->state_mutex);
50 mutex_init(&ctx->run_mutex);
51 init_waitqueue_head(&ctx->ibox_wq);
52 init_waitqueue_head(&ctx->wbox_wq);
53 init_waitqueue_head(&ctx->stop_wq);
54 init_waitqueue_head(&ctx->mfc_wq);
55 init_waitqueue_head(&ctx->run_wq);
56 ctx->state = SPU_STATE_SAVED;
57 ctx->ops = &spu_backing_ops;
58 ctx->owner = get_task_mm(current);
59 INIT_LIST_HEAD(&ctx->rq);
60 INIT_LIST_HEAD(&ctx->aff_list);
62 spu_gang_add_ctx(gang, ctx);
64 __spu_update_sched_info(ctx);
65 spu_set_timeslice(ctx);
66 ctx->stats.util_state = SPU_UTIL_IDLE_LOADED;
68 atomic_inc(&nr_spu_contexts);
77 void destroy_spu_context(struct kref *kref)
79 struct spu_context *ctx;
80 ctx = container_of(kref, struct spu_context, kref);
81 mutex_lock(&ctx->state_mutex);
83 mutex_unlock(&ctx->state_mutex);
84 spu_fini_csa(&ctx->csa);
86 spu_gang_remove_ctx(ctx->gang, ctx);
87 if (ctx->prof_priv_kref)
88 kref_put(ctx->prof_priv_kref, ctx->prof_priv_release);
89 BUG_ON(!list_empty(&ctx->rq));
90 atomic_dec(&nr_spu_contexts);
94 struct spu_context * get_spu_context(struct spu_context *ctx)
100 int put_spu_context(struct spu_context *ctx)
102 return kref_put(&ctx->kref, &destroy_spu_context);
105 /* give up the mm reference when the context is about to be destroyed */
106 void spu_forget(struct spu_context *ctx)
108 struct mm_struct *mm;
111 * This is basically an open-coded spu_acquire_saved, except that
112 * we don't acquire the state mutex interruptible, and we don't
113 * want this context to be rescheduled on release.
115 mutex_lock(&ctx->state_mutex);
116 if (ctx->state != SPU_STATE_SAVED)
125 void spu_unmap_mappings(struct spu_context *ctx)
127 mutex_lock(&ctx->mapping_lock);
128 if (ctx->local_store)
129 unmap_mapping_range(ctx->local_store, 0, LS_SIZE, 1);
131 unmap_mapping_range(ctx->mfc, 0, 0x1000, 1);
133 unmap_mapping_range(ctx->cntl, 0, 0x1000, 1);
135 unmap_mapping_range(ctx->signal1, 0, PAGE_SIZE, 1);
137 unmap_mapping_range(ctx->signal2, 0, PAGE_SIZE, 1);
139 unmap_mapping_range(ctx->mss, 0, 0x1000, 1);
141 unmap_mapping_range(ctx->psmap, 0, 0x20000, 1);
142 mutex_unlock(&ctx->mapping_lock);
146 * spu_acquire_saved - lock spu contex and make sure it is in saved state
147 * @ctx: spu contex to lock
149 int spu_acquire_saved(struct spu_context *ctx)
153 ret = spu_acquire(ctx);
157 if (ctx->state != SPU_STATE_SAVED) {
158 set_bit(SPU_SCHED_WAS_ACTIVE, &ctx->sched_flags);
166 * spu_release_saved - unlock spu context and return it to the runqueue
167 * @ctx: context to unlock
169 void spu_release_saved(struct spu_context *ctx)
171 BUG_ON(ctx->state != SPU_STATE_SAVED);
173 if (test_and_clear_bit(SPU_SCHED_WAS_ACTIVE, &ctx->sched_flags) &&
174 test_bit(SPU_SCHED_SPU_RUN, &ctx->sched_flags))
175 spu_activate(ctx, 0);