gem5  v19.0.0.0
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
condcodes.hh
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2003-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;
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.
15  *
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.
27  *
28  * Authors: Gabe Black
29  */
30 
31 #ifndef __BASE_CONDCODE_HH__
32 #define __BASE_CONDCODE_HH__
33 
34 #include "base/bitfield.hh"
35 #include "base/trace.hh"
36 
81 inline
82 bool
83 findCarry(int width, uint64_t dest, uint64_t src1, uint64_t src2) {
84  int shift = width - 1;
85  return ((~(dest >> shift) & 1) +
86  ((src1 >> shift) & 1) +
87  ((src2 >> shift) & 1)) & 0x2;
88 }
89 
93 inline
94 bool
95 findOverflow(int width, uint64_t dest, uint64_t src1, uint64_t src2) {
96  int shift = width - 1;
97  return ((src1 ^ ~src2) & (src1 ^ dest)) & (1ULL << shift);
98 }
99 
116 inline
117 bool
118 findParity(int width, uint64_t dest) {
119  dest &= mask(width);
120  dest ^= (dest >> 32);
121  dest ^= (dest >> 16);
122  dest ^= (dest >> 8);
123  dest ^= (dest >> 4);
124  dest ^= (dest >> 2);
125  dest ^= (dest >> 1);
126  return dest & 1;
127 }
128 
132 inline
133 bool
134 findNegative(int width, uint64_t dest) {
135  return bits(dest, width - 1, width - 1);
136 }
137 
141 inline
142 bool
143 findZero(int width, uint64_t dest) {
144  return !(dest & mask(width));
145 }
146 
147 #endif // __BASE_CONDCODE_HH__
bool findNegative(int width, uint64_t dest)
Calculate the negative flag.
Definition: condcodes.hh:134
Bitfield< 6, 5 > shift
Definition: types.hh:127
bool findZero(int width, uint64_t dest)
Calculate the zero flag.
Definition: condcodes.hh:143
#define ULL(N)
uint64_t constant
Definition: types.hh:50
bool findParity(int width, uint64_t dest)
Calculate the parity of a value.
Definition: condcodes.hh:118
Bitfield< 4 > width
Bitfield< 3, 0 > mask
Definition: types.hh:64
T bits(T val, int first, int last)
Extract the bitfield from position &#39;first&#39; to &#39;last&#39; (inclusive) from &#39;val&#39; and right justify it...
Definition: bitfield.hh:72
bool findCarry(int width, uint64_t dest, uint64_t src1, uint64_t src2)
Calculate the carry flag from an addition.
Definition: condcodes.hh:83
bool findOverflow(int width, uint64_t dest, uint64_t src1, uint64_t src2)
Calculate the overflow flag from an addition.
Definition: condcodes.hh:95

Generated on Fri Feb 28 2020 16:26:58 for gem5 by doxygen 1.8.13