atomic.cc (5100:7a0180040755) | atomic.cc (5101:8af5a6a6223d) |
---|---|
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; --- 238 unchanged lines hidden (view full) --- 247 248 assert(thread_num == 0); 249 assert(thread); 250 251 assert(_status == Idle); 252 assert(!tickEvent.scheduled()); 253 254 notIdleFraction++; | 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; --- 238 unchanged lines hidden (view full) --- 247 248 assert(thread_num == 0); 249 assert(thread); 250 251 assert(_status == Idle); 252 assert(!tickEvent.scheduled()); 253 254 notIdleFraction++; |
255 numCycles += tickToCycles(thread->lastActivate - thread->lastSuspend); |
|
255 256 //Make sure ticks are still on multiples of cycles 257 tickEvent.schedule(nextCycle(curTick + ticks(delay))); 258 _status = Running; 259} 260 261 262void --- 444 unchanged lines hidden --- | 256 257 //Make sure ticks are still on multiples of cycles 258 tickEvent.schedule(nextCycle(curTick + ticks(delay))); 259 _status = Running; 260} 261 262 263void --- 444 unchanged lines hidden --- |