1/* 2 * Copyright (c) 2004-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; --- 25 unchanged lines hidden (view full) --- 34ReturnAddrStack::init(unsigned _numEntries) 35{ 36 numEntries = _numEntries; 37 usedEntries = 0; 38 tos = 0; 39 40 addrStack.resize(numEntries); 41 |
42 for (unsigned i = 0; i < numEntries; ++i) |
43 addrStack[i] = 0; 44} 45 46void 47ReturnAddrStack::reset() 48{ 49 usedEntries = 0; 50 tos = 0; |
51 for (unsigned i = 0; i < numEntries; ++i) |
52 addrStack[i] = 0; 53} 54 55void 56ReturnAddrStack::push(const Addr &return_addr) 57{ 58 incrTos(); 59 --- 25 unchanged lines hidden --- |