base.cc (3144:b6e9e1811d71) base.cc (3495:884bf1f0c0c9)
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;

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

254 }
255 } else if (size == 1)
256 threadContexts[0]->regStats(name());
257
258#if FULL_SYSTEM
259#endif
260}
261
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;

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

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

--- 164 unchanged lines hidden --- 		283void
284BaseCPU::registerThreadContexts()
285{
286 for (int i = 0; i < threadContexts.size(); ++i) {
287 ThreadContext *tc = threadContexts[i];
288
289#if FULL_SYSTEM
290 int id = params->cpu_id;

--- 164 unchanged lines hidden ---