1/// Copyright (c) 2009 The Regents of The University of Michigan 2// All rights reserved. 3// 4// Redistribution and use in source and binary forms, with or without 5// modification, are permitted provided that the following conditions are 6// met: redistributions of source code must retain the above copyright 7// notice, this list of conditions and the following disclaimer; 8// redistributions in binary form must reproduce the above copyright --- 1029 unchanged lines hidden (view full) --- 1038 resBits = (uint64_t)(arg1 * arg2); 1039 } else { 1040 resBits = arg1Bits * arg2Bits; 1041 } 1042 1043 if (ext & 0x4) 1044 resBits += (ULL(1) << (destBits - 1)); 1045 |
1046 if (multHi()) |
1047 resBits >>= destBits; 1048 1049 int destHiIndex = (i + 1) * destBits - 1; 1050 int destLoIndex = (i + 0) * destBits; 1051 result = insertBits(result, destHiIndex, destLoIndex, resBits); 1052 } 1053 FpDestReg.uqw = result; 1054 ''' --- 501 unchanged lines hidden --- |