ruby: cleaning up RubyQueue and RubyNetwork dprintfs
[gem5.git] / src / mem / protocol / RubySlicc_Util.sm
1
2 /*
3 * Copyright (c) 1999-2005 Mark D. Hill and David A. Wood
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are
8 * met: redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer;
10 * redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution;
13 * neither the name of the copyright holders nor the names of its
14 * contributors may be used to endorse or promote products derived from
15 * this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30 // Miscallaneous Functions
31
32 void error(std::string msg);
33 void assert(bool condition);
34 int random(int number);
35 Time get_time();
36 Time zero_time();
37 NodeID intToID(int nodenum);
38 int IDToInt(NodeID id);
39 int addressToInt(Address addr);
40 bool multicast_retry();
41 int numberOfNodes();
42 int numberOfL1CachePerChip();
43 int getAddThenMod(int addend1, int addend2, int modulus);
44 int time_to_int(Time time);
45 Time getTimeModInt(Time time, int modulus);
46 Time getTimePlusInt(Time addend1, int addend2);
47 Time getTimeMinusTime(Time t1, Time t2);
48 Time getPreviousDelayedCycles(Time t1, Time t2);
49 void procProfileCoherenceRequest(NodeID node, bool needCLB);
50 void dirProfileCoherenceRequest(NodeID node, bool needCLB);
51 bool isPerfectProtocol();
52 bool L1trainsPrefetcher();
53 int max_tokens();
54 bool distributedPersistentEnabled();
55 Address setOffset(Address addr, int offset);
56 Address makeLineAddress(Address addr);
57 int addressOffset(Address addr);
58