Merge zizzer.eecs.umich.edu:/bk/newmem/
[gem5.git] / src / arch / sparc / interrupts.hh
1 /*
2 * Copyright (c) 2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Gabe Black
29 */
30
31 #ifndef __ARCH_SPARC_INTERRUPT_HH__
32 #define __ARCH_SPARC_INTERRUPT_HH__
33
34 #include "arch/sparc/faults.hh"
35
36 namespace SparcISA
37 {
38 class Interrupts
39 {
40 protected:
41 Fault interrupts[NumInterruptLevels];
42 bool requested[NumInterruptLevels];
43
44 public:
45 Interrupts()
46 {
47 for(int x = 0; x < NumInterruptLevels; x++)
48 {
49 interrupts[x] = new InterruptLevelN(x);
50 requested[x] = false;
51 }
52 }
53 void post(int int_num, int index)
54 {
55 if(int_num < 0 || int_num >= NumInterruptLevels)
56 panic("int_num out of bounds\n");
57
58 requested[int_num] = true;
59 }
60
61 void clear(int int_num, int index)
62 {
63 requested[int_num] = false;
64 }
65
66 void clear_all()
67 {
68 for(int x = 0; x < NumInterruptLevels; x++)
69 requested[x] = false;
70 }
71
72 bool check_interrupts(ThreadContext * tc) const
73 {
74 return true;
75 }
76
77 Fault getInterrupt(ThreadContext * tc)
78 {
79 return NoFault;
80 }
81
82 void serialize(std::ostream &os)
83 {
84 }
85
86 void unserialize(Checkpoint *cp, const std::string &section)
87 {
88 }
89 };
90 }
91
92 #endif // __ARCH_SPARC_INTERRUPT_HH__