2 * Copyright (c) 2010-2012 ARM Limited
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions are
16 * met: redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer;
18 * redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution;
21 * neither the name of the copyright holders nor the names of its
22 * contributors may be used to endorse or promote products derived from
23 * this software without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
26 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
27 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
28 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
29 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
30 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
31 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
32 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
33 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
34 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
35 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
40 #include "base/intmath.hh"
41 #include "base/time.hh"
42 #include "base/trace.hh"
43 #include "debug/Checkpoint.hh"
44 #include "debug/Timer.hh"
45 #include "dev/arm/amba_device.hh"
46 #include "dev/arm/rtc_pl031.hh"
47 #include "mem/packet.hh"
48 #include "mem/packet_access.hh"
50 PL031::PL031(Params
*p
)
51 : AmbaIntDevice(p
, 0xfff), timeVal(mkutctime(&p
->time
)),
52 lastWrittenTick(0), loadVal(0), matchVal(0),
53 rawInt(false), maskInt(false), pendingInt(false), matchEvent(this)
59 PL031::read(PacketPtr pkt
)
61 assert(pkt
->getAddr() >= pioAddr
&& pkt
->getAddr() < pioAddr
+ pioSize
);
62 assert(pkt
->getSize() == 4);
63 Addr daddr
= pkt
->getAddr() - pioAddr
;
66 DPRINTF(Timer
, "Reading from RTC at offset: %#x\n", daddr
);
70 data
= timeVal
+ ((curTick() - lastWrittenTick
) / SimClock::Int::s
);
79 data
= 1; // Always enabled otherwise there is no point
91 if (readId(pkt
, ambaId
, pioAddr
)) {
92 // Hack for variable sized access
93 data
= pkt
->get
<uint32_t>();
96 panic("Tried to read PL031 at offset %#x that doesn't exist\n", daddr
);
100 switch(pkt
->getSize()) {
102 pkt
->set
<uint8_t>(data
);
105 pkt
->set
<uint16_t>(data
);
108 pkt
->set
<uint32_t>(data
);
111 panic("Uart read size too big?\n");
116 pkt
->makeAtomicResponse();
121 PL031::write(PacketPtr pkt
)
123 assert(pkt
->getAddr() >= pioAddr
&& pkt
->getAddr() < pioAddr
+ pioSize
);
124 assert(pkt
->getSize() == 4);
125 Addr daddr
= pkt
->getAddr() - pioAddr
;
126 DPRINTF(Timer
, "Writing to RTC at offset: %#x\n", daddr
);
132 matchVal
= pkt
->get
<uint32_t>();
136 lastWrittenTick
= curTick();
137 timeVal
= pkt
->get
<uint32_t>();
142 break; // Can't stop when started
144 maskInt
= pkt
->get
<uint32_t>();
147 if (pkt
->get
<uint32_t>()) {
153 if (readId(pkt
, ambaId
, pioAddr
))
155 panic("Tried to read PL031 at offset %#x that doesn't exist\n", daddr
);
159 pkt
->makeAtomicResponse();
166 DPRINTF(Timer
, "Setting up new match event match=%d time=%d\n", matchVal
,
169 uint32_t seconds_until
= matchVal
- timeVal
;
170 Tick ticks_until
= SimClock::Int::s
* seconds_until
;
172 if (matchEvent
.scheduled()) {
173 DPRINTF(Timer
, "-- Event was already schedule, de-scheduling\n");
174 deschedule(matchEvent
);
176 schedule(matchEvent
, curTick() + ticks_until
);
177 DPRINTF(Timer
, "-- Scheduling new event for: %d\n", curTick() + ticks_until
);
181 PL031::counterMatch()
183 DPRINTF(Timer
, "Counter reached zero\n");
186 bool old_pending
= pendingInt
;
187 pendingInt
= maskInt
& rawInt
;
188 if (pendingInt
&& !old_pending
) {
189 DPRINTF(Timer
, "-- Causing interrupt\n");
190 gic
->sendInt(intNum
);
195 PL031::serialize(CheckpointOut
&cp
) const
197 DPRINTF(Checkpoint
, "Serializing Arm PL031\n");
198 SERIALIZE_SCALAR(timeVal
);
199 SERIALIZE_SCALAR(lastWrittenTick
);
200 SERIALIZE_SCALAR(loadVal
);
201 SERIALIZE_SCALAR(matchVal
);
202 SERIALIZE_SCALAR(rawInt
);
203 SERIALIZE_SCALAR(maskInt
);
204 SERIALIZE_SCALAR(pendingInt
);
206 bool is_in_event
= matchEvent
.scheduled();
207 SERIALIZE_SCALAR(is_in_event
);
211 event_time
= matchEvent
.when();
212 SERIALIZE_SCALAR(event_time
);
217 PL031::unserialize(CheckpointIn
&cp
)
219 DPRINTF(Checkpoint
, "Unserializing Arm PL031\n");
221 UNSERIALIZE_SCALAR(timeVal
);
222 UNSERIALIZE_SCALAR(lastWrittenTick
);
223 UNSERIALIZE_SCALAR(loadVal
);
224 UNSERIALIZE_SCALAR(matchVal
);
225 UNSERIALIZE_SCALAR(rawInt
);
226 UNSERIALIZE_SCALAR(maskInt
);
227 UNSERIALIZE_SCALAR(pendingInt
);
230 UNSERIALIZE_SCALAR(is_in_event
);
234 UNSERIALIZE_SCALAR(event_time
);
235 schedule(matchEvent
, event_time
);
242 PL031Params::create()
244 return new PL031(this);