| 1 |
207 |
jeremybenn |
/*
|
| 2 |
|
|
(C) Copyright IBM Corp. 2008
|
| 3 |
|
|
|
| 4 |
|
|
All rights reserved.
|
| 5 |
|
|
|
| 6 |
|
|
Redistribution and use in source and binary forms, with or without
|
| 7 |
|
|
modification, are permitted provided that the following conditions are met:
|
| 8 |
|
|
|
| 9 |
|
|
* Redistributions of source code must retain the above copyright notice,
|
| 10 |
|
|
this list of conditions and the following disclaimer.
|
| 11 |
|
|
* Redistributions in binary form must reproduce the above copyright
|
| 12 |
|
|
notice, this list of conditions and the following disclaimer in the
|
| 13 |
|
|
documentation and/or other materials provided with the distribution.
|
| 14 |
|
|
* Neither the name of IBM nor the names of its contributors may be
|
| 15 |
|
|
used to endorse or promote products derived from this software without
|
| 16 |
|
|
specific prior written permission.
|
| 17 |
|
|
|
| 18 |
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 19 |
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 20 |
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 21 |
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
| 22 |
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 23 |
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 24 |
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
| 25 |
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
| 26 |
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
| 27 |
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 28 |
|
|
POSSIBILITY OF SUCH DAMAGE.
|
| 29 |
|
|
*/
|
| 30 |
|
|
|
| 31 |
|
|
/* SPU timer free library service. */
|
| 32 |
|
|
#include <spu_timer.h>
|
| 33 |
|
|
#include "spu_timer_internal.h"
|
| 34 |
|
|
|
| 35 |
|
|
|
| 36 |
|
|
/* Frees an allocated timer. The timer must be in the stopped state for this
|
| 37 |
|
|
to succeed. Maybe be called:
|
| 38 |
|
|
* after allocated, before it's started
|
| 39 |
|
|
* after it's been explicitly stopped
|
| 40 |
|
|
Returns 0 on success, timer sucessfully deallocated. Returns <0 on failure
|
| 41 |
|
|
* SPU_TIMER_INVALID_ID - id out of range
|
| 42 |
|
|
* SPU_TIMER_ERR_FREE - id in free state
|
| 43 |
|
|
* SPU_TIMER_ERR_ACTIVE - id in handled or active state */
|
| 44 |
|
|
int
|
| 45 |
|
|
spu_timer_free (int id)
|
| 46 |
|
|
{
|
| 47 |
|
|
spu_timer_t *t, **pn;
|
| 48 |
|
|
unsigned was_enabled;
|
| 49 |
|
|
|
| 50 |
|
|
if (id < 0 || id >= SPU_TIMER_NTIMERS)
|
| 51 |
|
|
return SPU_TIMER_ERR_INVALID_ID;
|
| 52 |
|
|
|
| 53 |
|
|
if (__spu_timers[id].state == SPU_TIMER_STOPPED)
|
| 54 |
|
|
{
|
| 55 |
|
|
|
| 56 |
|
|
was_enabled = spu_readch (SPU_RdMachStat) & 0x1;
|
| 57 |
|
|
spu_idisable ();
|
| 58 |
|
|
|
| 59 |
|
|
t = __spu_timers_stopped;
|
| 60 |
|
|
pn = &__spu_timers_stopped;
|
| 61 |
|
|
|
| 62 |
|
|
while (t && (t->id != id))
|
| 63 |
|
|
{
|
| 64 |
|
|
pn = &t->next;
|
| 65 |
|
|
t = t->next;
|
| 66 |
|
|
}
|
| 67 |
|
|
#ifdef SPU_TIMER_DEBUG
|
| 68 |
|
|
if (!t)
|
| 69 |
|
|
ABORT ();
|
| 70 |
|
|
#endif
|
| 71 |
|
|
*pn = t->next;
|
| 72 |
|
|
|
| 73 |
|
|
/* Add timer back to free list (mask). */
|
| 74 |
|
|
__spu_timers_avail |= (1 << (id));
|
| 75 |
|
|
__spu_timers[id].state = SPU_TIMER_FREE;
|
| 76 |
|
|
|
| 77 |
|
|
if (__likely (was_enabled))
|
| 78 |
|
|
spu_ienable ();
|
| 79 |
|
|
|
| 80 |
|
|
return 0;
|
| 81 |
|
|
}
|
| 82 |
|
|
|
| 83 |
|
|
/* Handle invalid states. */
|
| 84 |
|
|
return (__spu_timers[id].state == SPU_TIMER_FREE) ?
|
| 85 |
|
|
SPU_TIMER_ERR_FREE : SPU_TIMER_ERR_ACTIVE;
|
| 86 |
|
|
}
|
