A fixed point library from Trenki http://www.trenki.net/content/view/17/1/ Slightly modified so that the fixed point data structure can automatically cast itself to float or int when used in an expression.

Revision:
0:aa2871c4c041
diff -r 000000000000 -r aa2871c4c041 fixed_class.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/fixed_class.h	Wed Oct 20 02:20:46 2010 +0000
@@ -0,0 +1,189 @@
+/*
+Copyright (c) 2007, Markus Trenkwalder
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without 
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, 
+  this list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation 
+  and/or other materials provided with the distribution.
+
+* Neither the name of the library's copyright owner nor the names of its 
+  contributors may be used to endorse or promote products derived from this 
+  software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#ifndef FIXEDP_CLASS_H_INCLUDED
+#define FIXEDP_CLASS_H_INCLUDED
+
+#ifdef _MSC_VER
+#pragma once
+#endif
+
+#include "fixed_func.h"
+
+namespace fixedpoint {
+
+// The template argument p in all of the following functions refers to the 
+// fixed point precision (e.g. p = 8 gives 24.8 fixed point functions).
+
+template <int p>
+struct fixed_point {
+    int32_t intValue;
+    
+    fixed_point() {}
+    /*explicit*/ fixed_point(int32_t i) : intValue(i << p) {}
+    /*explicit*/ fixed_point(float f) : intValue(float2fix<p>(f)) {}
+    /*explicit*/ fixed_point(double f) : intValue(float2fix<p>((float)f)) {}
+    
+    fixed_point& operator += (fixed_point r) { intValue += r.intValue; return *this; }
+    fixed_point& operator -= (fixed_point r) { intValue -= r.intValue; return *this; }
+    fixed_point& operator *= (fixed_point r) { intValue = fixmul<p>(intValue, r.intValue); return *this; }
+    fixed_point& operator /= (fixed_point r) { intValue = fixdiv<p>(intValue, r.intValue); return *this; }
+    
+    fixed_point& operator *= (int32_t r) { intValue *= r; return *this; }
+    fixed_point& operator /= (int32_t r) { intValue /= r; return *this; }
+    
+    fixed_point operator - () const { fixed_point x; x.intValue = -intValue; return x; }
+    fixed_point operator + (fixed_point r) const { fixed_point x = *this; x += r; return x;}
+    fixed_point operator - (fixed_point r) const { fixed_point x = *this; x -= r; return x;}
+    fixed_point operator * (fixed_point r) const { fixed_point x = *this; x *= r; return x;}
+    fixed_point operator / (fixed_point r) const { fixed_point x = *this; x /= r; return x;}
+    
+    bool operator == (fixed_point r) const { return intValue == r.intValue; }
+    bool operator != (fixed_point r) const { return !(*this == r); }
+    bool operator <  (fixed_point r) const { return intValue < r.intValue; }
+    bool operator >  (fixed_point r) const { return intValue > r.intValue; }
+    bool operator <= (fixed_point r) const { return intValue <= r.intValue; }
+    bool operator >= (fixed_point r) const { return intValue >= r.intValue; }
+
+    fixed_point operator + (int32_t r) const { fixed_point x = *this; x += r; return x;}
+    fixed_point operator - (int32_t r) const { fixed_point x = *this; x -= r; return x;}
+    fixed_point operator * (int32_t r) const { fixed_point x = *this; x *= r; return x;}
+    fixed_point operator / (int32_t r) const { fixed_point x = *this; x /= r; return x;}
+    operator int()         const { return intValue>>p; }
+    operator float()       const { return fix2float<p>(intValue); }
+};
+
+// Specializations for use with plain integers
+template <int p>
+inline fixed_point<p> operator + (int32_t a, fixed_point<p> b)
+{ return b + a; }
+
+template <int p>
+inline fixed_point<p> operator - (int32_t a, fixed_point<p> b)
+{ return -b + a; }
+
+template <int p>
+inline fixed_point<p> operator * (int32_t a, fixed_point<p> b)
+{ return b * a; }
+
+template <int p>
+inline fixed_point<p> operator / (int32_t a, fixed_point<p> b)
+{ fixed_point<p> r(a); r /= b; return r; }
+
+// math functions
+// no default implementation
+
+template <int p>
+inline fixed_point<p> sin(fixed_point<p> a);
+
+template <int p>
+inline fixed_point<p> cos(fixed_point<p> a);
+
+template <int p>
+inline fixed_point<p> sqrt(fixed_point<p> a);
+
+template <int p>
+inline fixed_point<p> rsqrt(fixed_point<p> a);
+
+template <int p>
+inline fixed_point<p> inv(fixed_point<p> a);
+
+template <int p>
+inline fixed_point<p> abs(fixed_point<p> a)
+{ 
+    fixed_point<p> r; 
+    r.intValue = a.intValue > 0 ? a.intValue : -a.intValue; 
+    return r; 
+}
+
+// specializations for 16.16 format
+
+template <>
+inline fixed_point<16> sin(fixed_point<16> a)
+{
+    fixed_point<16> r;
+    r.intValue = fixsin16(a.intValue);
+    return r;
+}
+
+template <>
+inline fixed_point<16> cos(fixed_point<16> a)
+{
+    fixed_point<16> r;
+    r.intValue = fixcos16(a.intValue);
+    return r;
+}
+
+
+template <>
+inline fixed_point<16> sqrt(fixed_point<16> a)
+{
+    fixed_point<16> r;
+    r.intValue = fixsqrt16(a.intValue);
+    return r;
+}
+
+template <>
+inline fixed_point<16> rsqrt(fixed_point<16> a)
+{
+    fixed_point<16> r;
+    r.intValue = fixrsqrt16(a.intValue);
+    return r;
+}
+
+template <>
+inline fixed_point<16> inv(fixed_point<16> a)
+{
+    fixed_point<16> r;
+    r.intValue = fixinv<16>(a.intValue);
+    return r;
+}
+
+// The multiply accumulate case can be optimized.
+template <int p>
+inline fixed_point<p> multiply_accumulate(
+    int count, 
+    const fixed_point<p> *a,
+    const fixed_point<p> *b)
+{
+    long long result = 0;
+    for (int i = 0; i < count; ++i)
+        result += static_cast<long long>(a[i].intValue) * b[i].intValue;
+    fixed_point<p> r;
+    r.intValue = static_cast<int>(result >> p);
+    return r;
+}
+
+} // end namespace fixedpoint
+
+#endif
+