#endif
#if wxUSE_LONGLONG
-
#include "wx/longlong.h"
#include <memory.h> // for memset()
+#include <math.h> // for fabs()
// ============================================================================
// implementation
// misc
// ----------------------------------------------------------------------------
-void *wxLongLongNative::asArray(void) const
+void *wxLongLongNative::asArray() const
{
static unsigned char temp[8];
for (int i = 0; i < 64; i++)
{
- result[63 - i] = '0' + (char) ((ll.m_ll >> i) & 1);
+ result[63 - i] = '0' + (char) ((ll.GetValue() >> i) & 1);
}
return o << result;
#endif // wxUSE_LONGLONG_NATIVE
+// ============================================================================
+// wxLongLongWx: emulation of 'long long' using 2 longs
+// ============================================================================
+
#if wxUSE_LONGLONG_WX
+// assignment
+wxLongLongWx& wxLongLongWx::Assign(double d)
+{
+ bool positive = d >= 0;
+ d = fabs(d);
+ if ( d <= ULONG_MAX )
+ {
+ m_hi = 0;
+ m_lo = (long)d;
+ }
+ else
+ {
+ m_hi = (unsigned long)(d / (1.0 + (double)ULONG_MAX));
+ m_lo = (unsigned long)(d - ((double)m_hi * (1.0 + (double)ULONG_MAX)));
+ }
+
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll = (wxLongLong_t)d;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
+ if ( !positive )
+ Negate();
+
+ return *this;
+}
+
wxLongLongWx wxLongLongWx::operator<<(int shift) const
{
- if (shift == 0)
- return *this;
+ wxLongLongWx ll(*this);
+ ll <<= shift;
- if (shift < 32)
- return wxLongLongWx((m_hi << shift) | (m_lo >> (32 - shift)),
- m_lo << shift);
- else
- return wxLongLongWx(m_lo << (shift - 32),
- 0);
+ return ll;
}
wxLongLongWx& wxLongLongWx::operator<<=(int shift)
{
- if (shift == 0)
- return *this;
-
- if (shift < 32)
+ if (shift != 0)
{
- m_hi <<= shift;
- m_hi |= m_lo >> (32 - shift);
- m_lo <<= shift;
- }
- else
- {
- m_hi = m_lo << (shift - 32);
- m_lo = 0;
+ if (shift < 32)
+ {
+ m_hi <<= shift;
+ m_hi |= m_lo >> (32 - shift);
+ m_lo <<= shift;
+ }
+ else
+ {
+ m_hi = m_lo << (shift - 32);
+ m_lo = 0;
+ }
}
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll <<= shift;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
wxLongLongWx wxLongLongWx::operator>>(int shift) const
{
- if (shift == 0)
- return *this;
+ wxLongLongWx ll(*this);
+ ll >>= shift;
- if (shift < 32)
- return wxLongLongWx(m_hi >> shift,
- (m_lo >> shift) | (m_hi << (32 - shift)));
- else
- return wxLongLongWx((m_hi < 0 ? -1l : 0),
- m_hi >> (shift - 32));
+ return ll;
}
wxLongLongWx& wxLongLongWx::operator>>=(int shift)
{
- if (shift == 0)
- return *this;
-
- if (shift < 32)
+ if (shift != 0)
{
- m_lo >>= shift;
- m_lo |= m_hi << (32 - shift);
- m_hi >>= shift;
- }
- else
- {
- m_lo = m_hi >> (shift - 32);
- m_hi = (m_hi < 0 ? -1L : 0);
+ if (shift < 32)
+ {
+ m_lo >>= shift;
+ m_lo |= m_hi << (32 - shift);
+ m_hi >>= shift;
+ }
+ else
+ {
+ m_lo = m_hi >> (shift - 32);
+ m_hi = (m_hi < 0 ? -1L : 0);
+ }
}
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll >>= shift;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
wxLongLongWx wxLongLongWx::operator+(const wxLongLongWx& ll) const
{
- wxLongLongWx temp;
+ wxLongLongWx res(*this);
+ res += ll;
- temp.m_lo = m_lo + ll.m_lo;
- temp.m_hi = m_hi + ll.m_hi;
- if ((temp.m_lo < m_lo) || (temp.m_lo < ll.m_lo))
- temp.m_hi++;
-
- return temp;
+ return res;
}
wxLongLongWx wxLongLongWx::operator+(long l) const
{
- wxLongLongWx temp;
-
- temp.m_lo = m_lo + l;
-
- if (l < 0)
- temp.m_hi += -1l;
-
- if ((temp.m_lo < m_lo) || (temp.m_lo < (unsigned long)l))
- temp.m_hi++;
+ wxLongLongWx res(*this);
+ res += l;
- return temp;
+ return res;
}
wxLongLongWx& wxLongLongWx::operator+=(const wxLongLongWx& ll)
if ((m_lo < previous) || (m_lo < ll.m_lo))
m_hi++;
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll += ll.m_ll;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
if ((m_lo < previous) || (m_lo < (unsigned long)l))
m_hi++;
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll += l;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
if (m_lo == 0)
m_hi++;
- return *this;
-}
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll++;
-// post increment
-wxLongLongWx& wxLongLongWx::operator++(int)
-{
- m_lo++;
- if (m_lo == 0)
- m_hi++;
+ Check();
+#endif // wxLONGLONG_TEST_MODE
return *this;
}
// negation
wxLongLongWx wxLongLongWx::operator-() const
{
- wxLongLongWx temp(~m_hi, ~m_lo);
+ wxLongLongWx res(*this);
+ res.Negate();
- temp.m_lo++;
- if (temp.m_lo == 0)
- temp.m_hi++;
+ return res;
+}
- return temp;
+wxLongLongWx& wxLongLongWx::Negate()
+{
+ m_hi = ~m_hi;
+ m_lo = ~m_lo;
+
+ m_lo++;
+ if ( m_lo == 0 )
+ m_hi++;
+
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll = -m_ll;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
+ return *this;
}
// subtraction
wxLongLongWx wxLongLongWx::operator-(const wxLongLongWx& ll) const
{
- wxLongLongWx temp;
+ wxLongLongWx res(*this);
+ res -= ll;
- temp.m_lo = m_lo - ll.m_lo;
- temp.m_hi = m_hi - ll.m_hi;
-
- if (m_lo < ll.m_lo)
- temp.m_hi--;
-
- return temp;
+ return res;
}
wxLongLongWx& wxLongLongWx::operator-=(const wxLongLongWx& ll)
if (previous < ll.m_lo)
m_hi--;
- return *this;;
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll -= ll.m_ll;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
+ return *this;
}
// pre decrement
if (m_lo == 0xFFFFFFFF)
m_hi--;
- return *this;
-}
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll--;
-// post decrement
-wxLongLongWx& wxLongLongWx::operator--(int)
-{
- m_lo--;
- if (m_lo == 0xFFFFFFFF)
- m_hi--;
+ Check();
+#endif // wxLONGLONG_TEST_MODE
return *this;
}
bool wxLongLongWx::operator<(const wxLongLongWx& ll) const
{
- if (m_lo < ll.m_lo)
- return 1;
- if (m_lo > ll.m_lo)
- return 0;
- if (m_hi < ll.m_hi)
- return 1;
- if (m_hi > ll.m_hi)
- return 0;
- return 0;
+ if ( m_hi < ll.m_hi )
+ return TRUE;
+ else if ( m_hi == ll.m_hi )
+ return m_lo < ll.m_lo;
+ else
+ return FALSE;
}
bool wxLongLongWx::operator>(const wxLongLongWx& ll) const
{
- if (m_lo < ll.m_lo)
- return 0;
- if (m_lo > ll.m_lo)
- return 1;
- if (m_hi < ll.m_hi)
- return 0;
- if (m_hi > ll.m_hi)
- return 1;
- return 0;
-}
-
-bool wxLongLongWx::operator<=(const wxLongLongWx& ll) const
-{
- if (m_lo < ll.m_lo)
- return 1;
- if (m_lo > ll.m_lo)
- return 0;
- if (m_hi < ll.m_hi)
- return 1;
- if (m_hi > ll.m_hi)
- return 0;
- return 1;
-}
-
-bool wxLongLongWx::operator>=(const wxLongLongWx& ll) const
-{
- if (m_lo < ll.m_lo)
- return 0;
- if (m_lo > ll.m_lo)
- return 1;
- if (m_hi < ll.m_hi)
- return 0;
- if (m_hi > ll.m_hi)
- return 1;
- return 1;
+ if ( m_hi > ll.m_hi )
+ return TRUE;
+ else if ( m_hi == ll.m_hi )
+ return m_lo > ll.m_lo;
+ else
+ return FALSE;
}
// bitwise operators
m_lo &= ll.m_lo;
m_hi &= ll.m_hi;
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll &= ll.m_ll;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
m_lo |= ll.m_lo;
m_hi |= ll.m_hi;
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll |= ll.m_ll;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
m_lo ^= ll.m_lo;
m_hi ^= ll.m_hi;
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll ^= ll.m_ll;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
wxLongLongWx wxLongLongWx::operator*(const wxLongLongWx& ll) const
{
- wxLongLongWx t(m_hi, m_lo);
- wxLongLongWx q(ll.m_hi, ll.m_lo);
- wxLongLongWx p;
- int counter = 0;
+ wxLongLongWx res(*this);
+ res *= ll;
- do
- {
- if ((q.m_lo & 1) != 0)
- p += t;
- q >>= 1;
- t <<= 1;
- counter++;
- }
- while ((counter < 64) && ((q.m_hi != 0) || (q.m_lo != 0)));
- return p;
+ return res;
}
wxLongLongWx& wxLongLongWx::operator*=(const wxLongLongWx& ll)
{
wxLongLongWx t(m_hi, m_lo);
wxLongLongWx q(ll.m_hi, ll.m_lo);
- int counter = 0;
+ m_hi = m_lo = 0;
+
+#ifdef wxLONGLONG_TEST_MODE
+ wxLongLong_t llOld = m_ll;
+ m_ll = 0;
+#endif // wxLONGLONG_TEST_MODE
+
+ int counter = 0;
do
{
if ((q.m_lo & 1) != 0)
- *this += t;
+ *this += t;
q >>= 1;
t <<= 1;
counter++;
- }
- while ((counter < 64) && ((q.m_hi != 0) || (q.m_lo != 0)));
+ }
+ while ((counter < 64) && ((q.m_hi != 0) || (q.m_lo != 0)));
+
+#ifdef wxLONGLONG_TEST_MODE
+ m_ll = llOld * ll.m_ll;
+
+ Check();
+#endif // wxLONGLONG_TEST_MODE
+
return *this;
}
// division
-void wxLongLongWx::Divide(const wxLongLongWx& divisor, wxLongLongWx& quotient, wxLongLongWx& remainder) const
+void wxLongLongWx::Divide(const wxLongLongWx& divisorIn,
+ wxLongLongWx& quotient,
+ wxLongLongWx& remainder) const
{
- if ((divisor.m_lo == 0) && (divisor.m_hi == 0))
+ if ((divisorIn.m_lo == 0) && (divisorIn.m_hi == 0))
{
// provoke division by zero error and silence the compilers warnings
// about an expression without effect and unused variable
- long dummy = divisor.m_lo/divisor.m_hi;
+ long dummy = divisorIn.m_lo/divisorIn.m_hi;
dummy += 0;
}
- wxFAIL_MSG("not implemented");
+ // VZ: I'm writing this in a hurry and it's surely not the fastest way to
+ // do this - any improvements are more than welcome
+ //
+ // code inspired by the snippet at
+ // http://www.bearcave.com/software/divide.htm
+ //
+ // Copyright notice:
+ //
+ // Use of this program, for any purpose, is granted the author, Ian
+ // Kaplan, as long as this copyright notice is included in the source
+ // code or any source code derived from this program. The user assumes
+ // all responsibility for using this code.
+
+ // init everything
+ wxLongLongWx dividend = *this,
+ divisor = divisorIn;
+
+ quotient = 0l;
+ remainder = 0l;
+
+ // always do unsigned division and adjust the signs later: in C integer
+ // division, the sign of the remainder is the same as the sign of the
+ // dividend, while the sign of the quotient is the product of the signs of
+ // the dividend and divisor. Of course, we also always have
+ //
+ // dividend = quotient*divisor + remainder
+ //
+ // with 0 <= abs(remainder) < abs(divisor)
+ bool negRemainder = dividend.m_hi < 0;
+ bool negQuotient = FALSE; // assume positive
+ if ( dividend.m_hi < 0 )
+ {
+ negQuotient = !negQuotient;
+ dividend = -dividend;
+ }
+ if ( divisor.m_hi < 0 )
+ {
+ negQuotient = !negQuotient;
+ divisor = -divisor;
+ }
+
+ // check for some particular cases
+ if ( divisor > dividend )
+ {
+ remainder = dividend;
+ }
+ else if ( divisor == dividend )
+ {
+ quotient = 1l;
+ }
+ else
+ {
+ // here: dividend > divisor and both are positibe: do unsigned division
+ size_t nBits = 64u;
+ wxLongLongWx d;
+
+ #define IS_MSB_SET(ll) ((ll.m_hi) & (1 << (8*sizeof(long) - 1)))
+
+ while ( remainder < divisor )
+ {
+ remainder <<= 1;
+ if ( IS_MSB_SET(dividend) )
+ {
+ remainder |= 1;
+ }
+
+ d = dividend;
+ dividend <<= 1;
+
+ nBits--;
+ }
+
+ // undo the last loop iteration
+ dividend = d;
+ remainder >>= 1;
+ nBits++;
+
+ for ( size_t i = 0; i < nBits; i++ )
+ {
+ remainder <<= 1;
+ if ( IS_MSB_SET(dividend) )
+ {
+ remainder |= 1;
+ }
+
+ wxLongLongWx t = remainder - divisor;
+ dividend <<= 1;
+ quotient <<= 1;
+ if ( !IS_MSB_SET(t) )
+ {
+ quotient |= 1;
+
+ remainder = t;
+ }
+ }
+ }
+
+ // adjust signs
+ if ( negRemainder )
+ {
+ remainder = -remainder;
+ }
+
+ if ( negQuotient )
+ {
+ quotient = -quotient;
+ }
+}
+
+wxLongLongWx wxLongLongWx::operator/(const wxLongLongWx& ll) const
+{
+ wxLongLongWx quotient, remainder;
+
+ Divide(ll, quotient, remainder);
+
+ return quotient;
}
+wxLongLongWx& wxLongLongWx::operator/=(const wxLongLongWx& ll)
+{
+ wxLongLongWx quotient, remainder;
+
+ Divide(ll, quotient, remainder);
+
+ *this = quotient;
+
+ return *this;
+}
+
+wxLongLongWx wxLongLongWx::operator%(const wxLongLongWx& ll) const
+{
+ wxLongLongWx quotient, remainder;
+
+ Divide(ll, quotient, remainder);
+
+ return remainder;
+}
+
+// ----------------------------------------------------------------------------
+// misc
+// ----------------------------------------------------------------------------
+
// temporary - just for testing
void *wxLongLongWx::asArray(void) const
{
static unsigned char temp[8];
- temp[0] = (m_hi >> 24) & 0xFF;
- temp[1] = (m_hi >> 16) & 0xFF;
- temp[2] = (m_hi >> 8) & 0xFF;
- temp[3] = (m_hi >> 0) & 0xFF;
- temp[4] = (m_lo >> 24) & 0xFF;
- temp[5] = (m_lo >> 16) & 0xFF;
- temp[6] = (m_lo >> 8) & 0xFF;
- temp[7] = (m_lo >> 0) & 0xFF;
+ temp[0] = (char)((m_hi >> 24) & 0xFF);
+ temp[1] = (char)((m_hi >> 16) & 0xFF);
+ temp[2] = (char)((m_hi >> 8) & 0xFF);
+ temp[3] = (char)((m_hi >> 0) & 0xFF);
+ temp[4] = (char)((m_lo >> 24) & 0xFF);
+ temp[5] = (char)((m_lo >> 16) & 0xFF);
+ temp[6] = (char)((m_lo >> 8) & 0xFF);
+ temp[7] = (char)((m_lo >> 0) & 0xFF);
return temp;
}
projects / wxWidgets.git / blobdiff