1/*
2 * Copyright (c) 2002-2005 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;

--- 83 unchanged lines hidden (view full) ---

92CPUProgressEvent::description()
93{
94 return "CPU Progress event";
95}
96
97#if FULL_SYSTEM
98BaseCPU::BaseCPU(Params *p)
99 : MemObject(p->name), clock(p->clock), checkInterrupts(true),
100 params(p), number_of_threads(p->numberOfThreads), system(p->system)
101#else
102BaseCPU::BaseCPU(Params *p)
103 : MemObject(p->name), clock(p->clock), params(p),
104 number_of_threads(p->numberOfThreads), system(p->system)
105#endif
106{
107// currentTick = curTick;
108 DPRINTF(FullCPU, "BaseCPU: Creating object, mem address %#x.\n", this);
109
110 // add self to global list of CPUs
111 cpuList.push_back(this);
112

--- 139 unchanged lines hidden (view full) ---

252
253#if FULL_SYSTEM
254#endif
255}
256
257Tick
258BaseCPU::nextCycle()
259{
260 Tick next_tick = curTick + clock - 1;
261 next_tick -= (next_tick % clock);
262 return next_tick;
263}
264
265Tick
266BaseCPU::nextCycle(Tick begin_tick)
267{
268 Tick next_tick = begin_tick;
269
270 while (next_tick < curTick)
271 next_tick += clock;
272
273 next_tick -= (next_tick % clock);
274 assert(next_tick >= curTick);
275 return next_tick;
276}
277
278void
279BaseCPU::registerThreadContexts()
280{
281 for (int i = 0; i < threadContexts.size(); ++i) {

--- 142 unchanged lines hidden ---