2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
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;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
33 * Defines global host-dependent types:
34 * Counter, Tick, and (indirectly) {int,uint}{8,16,32,64}_t.
37 #ifndef __BASE_TYPES_HH__
38 #define __BASE_TYPES_HH__
46 #include "base/refcnt.hh"
48 /** uint64_t constant */
49 #define ULL(N) ((uint64_t)N##ULL)
50 /** int64_t constant */
51 #define LL(N) ((int64_t)N##LL)
53 /** Statistics counter type. Not much excuse for not using a 64-bit
54 * integer here, but if you're desperate and only run short
55 * simulations you could make this 32 bits.
57 typedef int64_t Counter;
62 typedef uint64_t Tick;
64 const Tick MaxTick = ULL(0xffffffffffffffff);
67 * Cycles is a wrapper class for representing cycle counts, i.e. a
68 * relative difference between two points in time, expressed in a
69 * number of clock cycles.
71 * The Cycles wrapper class is a type-safe alternative to a
72 * typedef, aiming to avoid unintentional mixing of cycles and ticks
75 * Operators are defined inside an ifndef block to avoid swig touching
76 * them. Note that there is no overloading of the bool operator as the
77 * compiler is allowed to turn booleans into integers and this causes
78 * a whole range of issues in a handful locations. The solution to
79 * this problem would be to use the safe bool idiom, but for now we
80 * make do without the test and use the more elaborate comparison >
88 /** Member holding the actual value. */
93 /** Explicit constructor assigning a value. */
94 explicit Cycles(uint64_t _c) : c(_c) { }
96 /** Default constructor for parameter classes. */
99 #ifndef SWIG // keep the operators away from SWIG
101 /** Converting back to the value type. */
102 operator uint64_t() const { return c; }
104 /** Prefix increment operator. */
106 { ++c; return *this; }
108 /** Prefix decrement operator. Is only temporarily used in the O3 CPU. */
110 { assert(c != 0); --c; return *this; }
112 /** In-place addition of cycles. */
113 const Cycles& operator+=(const Cycles& cc)
114 { c += cc.c; return *this; }
116 /** Greater than comparison used for > Cycles(0). */
117 bool operator>(const Cycles& cc) const
120 const Cycles operator +(const Cycles& b) const
121 { return Cycles(c + b.c); }
123 const Cycles operator -(const Cycles& b) const
124 { assert(c >= b.c); return Cycles(c - b.c); }
126 const Cycles operator <<(const int32_t shift)
127 { return Cycles(c << shift); }
129 const Cycles operator >>(const int32_t shift)
130 { return Cycles(c >> shift); }
132 friend std::ostream& operator<<(std::ostream &out, const Cycles & cycles);
134 #endif // SWIG not touching operators
140 * This will probably be moved somewhere else in the near future.
141 * This should be at least as big as the biggest address width in use
142 * in the system, which will probably be 64 bits.
144 typedef uint64_t Addr;
146 typedef uint16_t MicroPC;
148 static const MicroPC MicroPCRomBit = 1 << (sizeof(MicroPC) * 8 - 1);
150 static inline MicroPC
151 romMicroPC(MicroPC upc)
153 return upc | MicroPCRomBit;
156 static inline MicroPC
157 normalMicroPC(MicroPC upc)
159 return upc & ~MicroPCRomBit;
163 isRomMicroPC(MicroPC upc)
165 return MicroPCRomBit & upc;
168 const Addr MaxAddr = (Addr)-1;
171 * Thread index/ID type
173 typedef int16_t ThreadID;
174 const ThreadID InvalidThreadID = (ThreadID)-1;
177 * Port index/ID type, and a symbolic name for an invalid port id.
179 typedef int16_t PortID;
180 const PortID InvalidPortID = (PortID)-1;
183 typedef std::shared_ptr<FaultBase> Fault;
185 #ifndef SWIG // Swig gets really confused by decltype
186 // Rather than creating a shared_ptr instance and assigning it nullptr,
187 // we just create an alias.
188 constexpr decltype(nullptr) NoFault = nullptr;
193 LittleEndianByteOrder
196 #endif // __BASE_TYPES_HH__