gem5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups 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 
41 inline
42 bool
43 findCarry(int width, uint64_t dest, uint64_t src1, uint64_t src2) {
44  int shift = width - 1;
45  return ((~(dest >> shift) & 1) +
46  ((src1 >> shift) & 1) +
47  ((src2 >> shift) & 1)) & 0x2;
48 }
49 
53 inline
54 bool
55 findOverflow(int width, uint64_t dest, uint64_t src1, uint64_t src2) {
56  int shift = width - 1;
57  return ((src1 ^ ~src2) & (src1 ^ dest)) & (1ULL << shift);
58 }
59 
63 inline
64 bool
65 findParity(int width, uint64_t dest) {
66  dest &= mask(width);
67  dest ^= (dest >> 32);
68  dest ^= (dest >> 16);
69  dest ^= (dest >> 8);
70  dest ^= (dest >> 4);
71  dest ^= (dest >> 2);
72  dest ^= (dest >> 1);
73  return dest & 1;
74 }
75 
79 inline
80 bool
81 findNegative(int width, uint64_t dest) {
82  return bits(dest, width - 1, width - 1);
83 }
84 
88 inline
89 bool
90 findZero(int width, uint64_t dest) {
91  return !(dest & mask(width));
92 }
93 
94 #endif // __BASE_CONDCODE_HH__
bool findNegative(int width, uint64_t dest)
Calculate the negative flag.
Definition: condcodes.hh:81
Bitfield< 6, 5 > shift
Definition: types.hh:122
bool findZero(int width, uint64_t dest)
Calculate the zero flag.
Definition: condcodes.hh:90
#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:65
Bitfield< 4 > width
Definition: miscregs.hh:1383
Bitfield< 3, 0 > mask
Definition: types.hh:64
T bits(T val, int first, int last)
Extract the bitfield from position 'first' to 'last' (inclusive) from 'val' and right justify it...
Definition: bitfield.hh:67
bool findCarry(int width, uint64_t dest, uint64_t src1, uint64_t src2)
Calculate the carry flag from an addition.
Definition: condcodes.hh:43
bool findOverflow(int width, uint64_t dest, uint64_t src1, uint64_t src2)
Calculate the overflow flag from an addition.
Definition: condcodes.hh:55

Generated on Fri Jun 9 2017 13:03:40 for gem5 by doxygen 1.8.6