| |
| /* |
| * Copyright (c) 1999-2005 Mark D. Hill and David A. Wood |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions are |
| * met: redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer; |
| * redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution; |
| * neither the name of the copyright holders nor the names of its |
| * contributors may be used to endorse or promote products derived from |
| * this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| |
| // Miscallaneous Functions |
| |
| void error(std::string msg); |
| void assert(bool condition); |
| int random(int number); |
| Time get_time(); |
| Time zero_time(); |
| NodeID intToID(int nodenum); |
| int IDToInt(NodeID id); |
| int addressToInt(Address addr); |
| bool multicast_retry(); |
| int numberOfNodes(); |
| int numberOfL1CachePerChip(); |
| int getAddThenMod(int addend1, int addend2, int modulus); |
| int time_to_int(Time time); |
| Time getTimeModInt(Time time, int modulus); |
| Time getTimePlusInt(Time addend1, int addend2); |
| Time getTimeMinusTime(Time t1, Time t2); |
| Time getPreviousDelayedCycles(Time t1, Time t2); |
| void procProfileCoherenceRequest(NodeID node, bool needCLB); |
| void dirProfileCoherenceRequest(NodeID node, bool needCLB); |
| bool isPerfectProtocol(); |
| bool L1trainsPrefetcher(); |
| int max_tokens(); |
| bool distributedPersistentEnabled(); |
| Address setOffset(Address addr, int offset); |
| Address makeLineAddress(Address addr); |
| int addressOffset(Address addr); |
| int mod(int val, int mod); |
