base.cc (3520:4f4a2054fd85) base.cc (3541:d74340b852f6)
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;

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

249 }
250 } else if (size == 1)
251 threadContexts[0]->regStats(name());
252
253#if FULL_SYSTEM
254#endif
255}
256
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;

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

249 }
250 } else if (size == 1)
251 threadContexts[0]->regStats(name());
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}
257
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
258void
259BaseCPU::registerThreadContexts()
260{
261 for (int i = 0; i < threadContexts.size(); ++i) {
262 ThreadContext *tc = threadContexts[i];
263
264#if FULL_SYSTEM
265 int id = params->cpu_id;

--- 138 unchanged lines hidden --- 		278void
279BaseCPU::registerThreadContexts()
280{
281 for (int i = 0; i < threadContexts.size(); ++i) {
282 ThreadContext *tc = threadContexts[i];
283
284#if FULL_SYSTEM
285 int id = params->cpu_id;

--- 138 unchanged lines hidden ---