Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/branches/ode/ode-0.9/docs/odemath_8h-source.html @ 216

Last change on this file since 216 was 216, checked in by mathiask, 16 years ago

[Physik] add ode-0.9
File size: 32.8 KB
Line 
1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
2<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
3<title>Open Dynamics Engine: odemath.h Source File</title>
4<link href="doxygen.css" rel="stylesheet" type="text/css">
5<link href="tabs.css" rel="stylesheet" type="text/css">
6</head><body>
7<!-- Generated by Doxygen 1.5.3 -->
8<div class="tabs">
9  <ul>
10    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
11    <li><a href="modules.html"><span>Modules</span></a></li>
12    <li><a href="annotated.html"><span>Data&nbsp;Structures</span></a></li>
13    <li class="current"><a href="files.html"><span>Files</span></a></li>
14  </ul>
15</div>
16<h1>odemath.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*************************************************************************</span>
17<a name="l00002"></a>00002 <span class="comment"> *                                                                       *</span>
18<a name="l00003"></a>00003 <span class="comment"> * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith.       *</span>
19<a name="l00004"></a>00004 <span class="comment"> * All rights reserved.  Email: russ@q12.org   Web: www.q12.org          *</span>
20<a name="l00005"></a>00005 <span class="comment"> *                                                                       *</span>
21<a name="l00006"></a>00006 <span class="comment"> * This library is free software; you can redistribute it and/or         *</span>
22<a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of EITHER:                                  *</span>
23<a name="l00008"></a>00008 <span class="comment"> *   (1) The GNU Lesser General Public License as published by the Free  *</span>
24<a name="l00009"></a>00009 <span class="comment"> *       Software Foundation; either version 2.1 of the License, or (at  *</span>
25<a name="l00010"></a>00010 <span class="comment"> *       your option) any later version. The text of the GNU Lesser      *</span>
26<a name="l00011"></a>00011 <span class="comment"> *       General Public License is included with this library in the     *</span>
27<a name="l00012"></a>00012 <span class="comment"> *       file LICENSE.TXT.                                               *</span>
28<a name="l00013"></a>00013 <span class="comment"> *   (2) The BSD-style license that is included with this library in     *</span>
29<a name="l00014"></a>00014 <span class="comment"> *       the file LICENSE-BSD.TXT.                                       *</span>
30<a name="l00015"></a>00015 <span class="comment"> *                                                                       *</span>
31<a name="l00016"></a>00016 <span class="comment"> * This library is distributed in the hope that it will be useful,       *</span>
32<a name="l00017"></a>00017 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of        *</span>
33<a name="l00018"></a>00018 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files    *</span>
34<a name="l00019"></a>00019 <span class="comment"> * LICENSE.TXT and LICENSE-BSD.TXT for more details.                     *</span>
35<a name="l00020"></a>00020 <span class="comment"> *                                                                       *</span>
36<a name="l00021"></a>00021 <span class="comment"> *************************************************************************/</span>
37<a name="l00022"></a>00022
38<a name="l00023"></a>00023 <span class="preprocessor">#ifndef _ODE_ODEMATH_H_</span>
39<a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#define _ODE_ODEMATH_H_</span>
40<a name="l00025"></a>00025 <span class="preprocessor"></span>
41<a name="l00026"></a>00026 <span class="preprocessor">#include &lt;ode/common.h&gt;</span>
42<a name="l00027"></a>00027
43<a name="l00028"></a>00028 <span class="preprocessor">#ifdef __GNUC__</span>
44<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#define PURE_INLINE extern inline</span>
45<a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor">#else</span>
46<a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor">#define PURE_INLINE inline</span>
47<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
48<a name="l00033"></a>00033 <span class="preprocessor"></span>
49<a name="l00034"></a>00034 <span class="comment">/*</span>
50<a name="l00035"></a>00035 <span class="comment"> * macro to access elements i,j in an NxM matrix A, independent of the</span>
51<a name="l00036"></a>00036 <span class="comment"> * matrix storage convention.</span>
52<a name="l00037"></a>00037 <span class="comment"> */</span>
53<a name="l00038"></a>00038 <span class="preprocessor">#define dACCESS33(A,i,j) ((A)[(i)*4+(j)])</span>
54<a name="l00039"></a>00039 <span class="preprocessor"></span>
55<a name="l00040"></a>00040 <span class="comment">/*</span>
56<a name="l00041"></a>00041 <span class="comment"> * Macro to test for valid floating point values</span>
57<a name="l00042"></a>00042 <span class="comment"> */</span>
58<a name="l00043"></a>00043 <span class="preprocessor">#define dVALIDVEC3(v) (!(dIsNan(v[0]) || dIsNan(v[1]) || dIsNan(v[2])))</span>
59<a name="l00044"></a>00044 <span class="preprocessor"></span><span class="preprocessor">#define dVALIDVEC4(v) (!(dIsNan(v[0]) || dIsNan(v[1]) || dIsNan(v[2]) || dIsNan(v[3])))</span>
60<a name="l00045"></a>00045 <span class="preprocessor"></span><span class="preprocessor">#define dVALIDMAT3(m) (!(dIsNan(m[0]) || dIsNan(m[1]) || dIsNan(m[2]) || dIsNan(m[3]) || dIsNan(m[4]) || dIsNan(m[5]) || dIsNan(m[6]) || dIsNan(m[7]) || dIsNan(m[8]) || dIsNan(m[9]) || dIsNan(m[10]) || dIsNan(m[11])))</span>
61<a name="l00046"></a>00046 <span class="preprocessor"></span><span class="preprocessor">#define dVALIDMAT4(m) (!(dIsNan(m[0]) || dIsNan(m[1]) || dIsNan(m[2]) || dIsNan(m[3]) || dIsNan(m[4]) || dIsNan(m[5]) || dIsNan(m[6]) || dIsNan(m[7]) || dIsNan(m[8]) || dIsNan(m[9]) || dIsNan(m[10]) || dIsNan(m[11]) || dIsNan(m[12]) || dIsNan(m[13]) || dIsNan(m[14]) || dIsNan(m[15]) ))</span>
62<a name="l00047"></a>00047 <span class="preprocessor"></span>
63<a name="l00048"></a>00048
64<a name="l00049"></a>00049
65<a name="l00050"></a>00050 <span class="comment">/*</span>
66<a name="l00051"></a>00051 <span class="comment"> * General purpose vector operations with other vectors or constants.</span>
67<a name="l00052"></a>00052 <span class="comment"> */</span>
68<a name="l00053"></a>00053
69<a name="l00054"></a>00054 <span class="preprocessor">#define dOP(a,op,b,c) \</span>
70<a name="l00055"></a>00055 <span class="preprocessor">    (a)[0] = ((b)[0]) op ((c)[0]); \</span>
71<a name="l00056"></a>00056 <span class="preprocessor">    (a)[1] = ((b)[1]) op ((c)[1]); \</span>
72<a name="l00057"></a>00057 <span class="preprocessor">    (a)[2] = ((b)[2]) op ((c)[2]);</span>
73<a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define dOPC(a,op,b,c) \</span>
74<a name="l00059"></a>00059 <span class="preprocessor">    (a)[0] = ((b)[0]) op (c); \</span>
75<a name="l00060"></a>00060 <span class="preprocessor">    (a)[1] = ((b)[1]) op (c); \</span>
76<a name="l00061"></a>00061 <span class="preprocessor">    (a)[2] = ((b)[2]) op (c);</span>
77<a name="l00062"></a>00062 <span class="preprocessor"></span><span class="preprocessor">#define dOPE(a,op,b) \</span>
78<a name="l00063"></a>00063 <span class="preprocessor">    (a)[0] op ((b)[0]); \</span>
79<a name="l00064"></a>00064 <span class="preprocessor">    (a)[1] op ((b)[1]); \</span>
80<a name="l00065"></a>00065 <span class="preprocessor">    (a)[2] op ((b)[2]);</span>
81<a name="l00066"></a>00066 <span class="preprocessor"></span><span class="preprocessor">#define dOPEC(a,op,c) \</span>
82<a name="l00067"></a>00067 <span class="preprocessor">    (a)[0] op (c); \</span>
83<a name="l00068"></a>00068 <span class="preprocessor">    (a)[1] op (c); \</span>
84<a name="l00069"></a>00069 <span class="preprocessor">    (a)[2] op (c);</span>
85<a name="l00070"></a>00070 <span class="preprocessor"></span>
86<a name="l00071"></a>00071
87<a name="l00072"></a>00072 <span class="comment">/*</span>
88<a name="l00073"></a>00073 <span class="comment"> * Length, and squared length helpers. dLENGTH returns the length of a dVector3.</span>
89<a name="l00074"></a>00074 <span class="comment"> * dLENGTHSQUARED return the squared length of a dVector3.</span>
90<a name="l00075"></a>00075 <span class="comment"> */</span>
91<a name="l00076"></a>00076
92<a name="l00077"></a>00077 <span class="preprocessor">#define dLENGTHSQUARED(a) (((a)[0])*((a)[0]) + ((a)[1])*((a)[1]) + ((a)[2])*((a)[2]))</span>
93<a name="l00078"></a>00078 <span class="preprocessor"></span>
94<a name="l00079"></a>00079 <span class="preprocessor">#ifdef __cplusplus</span>
95<a name="l00080"></a>00080 <span class="preprocessor"></span>
96<a name="l00081"></a>00081 PURE_INLINE dReal dLENGTH (<span class="keyword">const</span> dReal *a) { <span class="keywordflow">return</span> dSqrt(dLENGTHSQUARED(a)); }
97<a name="l00082"></a>00082
98<a name="l00083"></a>00083 <span class="preprocessor">#else</span>
99<a name="l00084"></a>00084 <span class="preprocessor"></span>
100<a name="l00085"></a>00085 <span class="preprocessor">#define dLENGTH(a) ( dSqrt( ((a)[0])*((a)[0]) + ((a)[1])*((a)[1]) + ((a)[2])*((a)[2]) ) )</span>
101<a name="l00086"></a>00086 <span class="preprocessor"></span>
102<a name="l00087"></a>00087 <span class="preprocessor">#endif </span><span class="comment">/* __cplusplus */</span>
103<a name="l00088"></a>00088
104<a name="l00089"></a>00089
105<a name="l00090"></a>00090
106<a name="l00091"></a>00091
107<a name="l00092"></a>00092
108<a name="l00093"></a>00093 <span class="comment">/*</span>
109<a name="l00094"></a>00094 <span class="comment"> * 3-way dot product. dDOTpq means that elements of `a' and `b' are spaced</span>
110<a name="l00095"></a>00095 <span class="comment"> * p and q indexes apart respectively. dDOT() means dDOT11.</span>
111<a name="l00096"></a>00096 <span class="comment"> * in C++ we could use function templates to get all the versions of these</span>
112<a name="l00097"></a>00097 <span class="comment"> * functions - but on some compilers this will result in sub-optimal code.</span>
113<a name="l00098"></a>00098 <span class="comment"> */</span>
114<a name="l00099"></a>00099
115<a name="l00100"></a>00100 <span class="preprocessor">#define dDOTpq(a,b,p,q) ((a)[0]*(b)[0] + (a)[p]*(b)[q] + (a)[2*(p)]*(b)[2*(q)])</span>
116<a name="l00101"></a>00101 <span class="preprocessor"></span>
117<a name="l00102"></a>00102 <span class="preprocessor">#ifdef __cplusplus</span>
118<a name="l00103"></a>00103 <span class="preprocessor"></span>
119<a name="l00104"></a>00104 PURE_INLINE dReal dDOT   (<span class="keyword">const</span> dReal *a, <span class="keyword">const</span> dReal *b) { <span class="keywordflow">return</span> dDOTpq(a,b,1,1); }
120<a name="l00105"></a>00105 PURE_INLINE dReal dDOT13 (<span class="keyword">const</span> dReal *a, <span class="keyword">const</span> dReal *b) { <span class="keywordflow">return</span> dDOTpq(a,b,1,3); }
121<a name="l00106"></a>00106 PURE_INLINE dReal dDOT31 (<span class="keyword">const</span> dReal *a, <span class="keyword">const</span> dReal *b) { <span class="keywordflow">return</span> dDOTpq(a,b,3,1); }
122<a name="l00107"></a>00107 PURE_INLINE dReal dDOT33 (<span class="keyword">const</span> dReal *a, <span class="keyword">const</span> dReal *b) { <span class="keywordflow">return</span> dDOTpq(a,b,3,3); }
123<a name="l00108"></a>00108 PURE_INLINE dReal dDOT14 (<span class="keyword">const</span> dReal *a, <span class="keyword">const</span> dReal *b) { <span class="keywordflow">return</span> dDOTpq(a,b,1,4); }
124<a name="l00109"></a>00109 PURE_INLINE dReal dDOT41 (<span class="keyword">const</span> dReal *a, <span class="keyword">const</span> dReal *b) { <span class="keywordflow">return</span> dDOTpq(a,b,4,1); }
125<a name="l00110"></a>00110 PURE_INLINE dReal dDOT44 (<span class="keyword">const</span> dReal *a, <span class="keyword">const</span> dReal *b) { <span class="keywordflow">return</span> dDOTpq(a,b,4,4); }
126<a name="l00111"></a>00111
127<a name="l00112"></a>00112 <span class="preprocessor">#else</span>
128<a name="l00113"></a>00113 <span class="preprocessor"></span>
129<a name="l00114"></a>00114 <span class="preprocessor">#define dDOT(a,b)   dDOTpq(a,b,1,1)</span>
130<a name="l00115"></a>00115 <span class="preprocessor"></span><span class="preprocessor">#define dDOT13(a,b) dDOTpq(a,b,1,3)</span>
131<a name="l00116"></a>00116 <span class="preprocessor"></span><span class="preprocessor">#define dDOT31(a,b) dDOTpq(a,b,3,1)</span>
132<a name="l00117"></a>00117 <span class="preprocessor"></span><span class="preprocessor">#define dDOT33(a,b) dDOTpq(a,b,3,3)</span>
133<a name="l00118"></a>00118 <span class="preprocessor"></span><span class="preprocessor">#define dDOT14(a,b) dDOTpq(a,b,1,4)</span>
134<a name="l00119"></a>00119 <span class="preprocessor"></span><span class="preprocessor">#define dDOT41(a,b) dDOTpq(a,b,4,1)</span>
135<a name="l00120"></a>00120 <span class="preprocessor"></span><span class="preprocessor">#define dDOT44(a,b) dDOTpq(a,b,4,4)</span>
136<a name="l00121"></a>00121 <span class="preprocessor"></span>
137<a name="l00122"></a>00122 <span class="preprocessor">#endif </span><span class="comment">/* __cplusplus */</span>
138<a name="l00123"></a>00123
139<a name="l00124"></a>00124
140<a name="l00125"></a>00125 <span class="comment">/*</span>
141<a name="l00126"></a>00126 <span class="comment"> * cross product, set a = b x c. dCROSSpqr means that elements of `a', `b'</span>
142<a name="l00127"></a>00127 <span class="comment"> * and `c' are spaced p, q and r indexes apart respectively.</span>
143<a name="l00128"></a>00128 <span class="comment"> * dCROSS() means dCROSS111. `op' is normally `=', but you can set it to</span>
144<a name="l00129"></a>00129 <span class="comment"> * +=, -= etc to get other effects.</span>
145<a name="l00130"></a>00130 <span class="comment"> */</span>
146<a name="l00131"></a>00131
147<a name="l00132"></a>00132 <span class="preprocessor">#define dCROSS(a,op,b,c) \</span>
148<a name="l00133"></a>00133 <span class="preprocessor">do { \</span>
149<a name="l00134"></a>00134 <span class="preprocessor">  (a)[0] op ((b)[1]*(c)[2] - (b)[2]*(c)[1]); \</span>
150<a name="l00135"></a>00135 <span class="preprocessor">  (a)[1] op ((b)[2]*(c)[0] - (b)[0]*(c)[2]); \</span>
151<a name="l00136"></a>00136 <span class="preprocessor">  (a)[2] op ((b)[0]*(c)[1] - (b)[1]*(c)[0]); \</span>
152<a name="l00137"></a>00137 <span class="preprocessor">} while(0)</span>
153<a name="l00138"></a>00138 <span class="preprocessor"></span><span class="preprocessor">#define dCROSSpqr(a,op,b,c,p,q,r) \</span>
154<a name="l00139"></a>00139 <span class="preprocessor">do { \</span>
155<a name="l00140"></a>00140 <span class="preprocessor">  (a)[  0] op ((b)[  q]*(c)[2*r] - (b)[2*q]*(c)[  r]); \</span>
156<a name="l00141"></a>00141 <span class="preprocessor">  (a)[  p] op ((b)[2*q]*(c)[  0] - (b)[  0]*(c)[2*r]); \</span>
157<a name="l00142"></a>00142 <span class="preprocessor">  (a)[2*p] op ((b)[  0]*(c)[  r] - (b)[  q]*(c)[  0]); \</span>
158<a name="l00143"></a>00143 <span class="preprocessor">} while(0)</span>
159<a name="l00144"></a>00144 <span class="preprocessor"></span><span class="preprocessor">#define dCROSS114(a,op,b,c) dCROSSpqr(a,op,b,c,1,1,4)</span>
160<a name="l00145"></a>00145 <span class="preprocessor"></span><span class="preprocessor">#define dCROSS141(a,op,b,c) dCROSSpqr(a,op,b,c,1,4,1)</span>
161<a name="l00146"></a>00146 <span class="preprocessor"></span><span class="preprocessor">#define dCROSS144(a,op,b,c) dCROSSpqr(a,op,b,c,1,4,4)</span>
162<a name="l00147"></a>00147 <span class="preprocessor"></span><span class="preprocessor">#define dCROSS411(a,op,b,c) dCROSSpqr(a,op,b,c,4,1,1)</span>
163<a name="l00148"></a>00148 <span class="preprocessor"></span><span class="preprocessor">#define dCROSS414(a,op,b,c) dCROSSpqr(a,op,b,c,4,1,4)</span>
164<a name="l00149"></a>00149 <span class="preprocessor"></span><span class="preprocessor">#define dCROSS441(a,op,b,c) dCROSSpqr(a,op,b,c,4,4,1)</span>
165<a name="l00150"></a>00150 <span class="preprocessor"></span><span class="preprocessor">#define dCROSS444(a,op,b,c) dCROSSpqr(a,op,b,c,4,4,4)</span>
166<a name="l00151"></a>00151 <span class="preprocessor"></span>
167<a name="l00152"></a>00152
168<a name="l00153"></a>00153 <span class="comment">/*</span>
169<a name="l00154"></a>00154 <span class="comment"> * set a 3x3 submatrix of A to a matrix such that submatrix(A)*b = a x b.</span>
170<a name="l00155"></a>00155 <span class="comment"> * A is stored by rows, and has `skip' elements per row. the matrix is</span>
171<a name="l00156"></a>00156 <span class="comment"> * assumed to be already zero, so this does not write zero elements!</span>
172<a name="l00157"></a>00157 <span class="comment"> * if (plus,minus) is (+,-) then a positive version will be written.</span>
173<a name="l00158"></a>00158 <span class="comment"> * if (plus,minus) is (-,+) then a negative version will be written.</span>
174<a name="l00159"></a>00159 <span class="comment"> */</span>
175<a name="l00160"></a>00160
176<a name="l00161"></a>00161 <span class="preprocessor">#define dCROSSMAT(A,a,skip,plus,minus) \</span>
177<a name="l00162"></a>00162 <span class="preprocessor">do { \</span>
178<a name="l00163"></a>00163 <span class="preprocessor">  (A)[1] = minus (a)[2]; \</span>
179<a name="l00164"></a>00164 <span class="preprocessor">  (A)[2] = plus (a)[1]; \</span>
180<a name="l00165"></a>00165 <span class="preprocessor">  (A)[(skip)+0] = plus (a)[2]; \</span>
181<a name="l00166"></a>00166 <span class="preprocessor">  (A)[(skip)+2] = minus (a)[0]; \</span>
182<a name="l00167"></a>00167 <span class="preprocessor">  (A)[2*(skip)+0] = minus (a)[1]; \</span>
183<a name="l00168"></a>00168 <span class="preprocessor">  (A)[2*(skip)+1] = plus (a)[0]; \</span>
184<a name="l00169"></a>00169 <span class="preprocessor">} while(0)</span>
185<a name="l00170"></a>00170 <span class="preprocessor"></span>
186<a name="l00171"></a>00171
187<a name="l00172"></a>00172 <span class="comment">/*</span>
188<a name="l00173"></a>00173 <span class="comment"> * compute the distance between two 3D-vectors</span>
189<a name="l00174"></a>00174 <span class="comment"> */</span>
190<a name="l00175"></a>00175
191<a name="l00176"></a>00176 <span class="preprocessor">#ifdef __cplusplus</span>
192<a name="l00177"></a>00177 <span class="preprocessor"></span>PURE_INLINE dReal dDISTANCE (<span class="keyword">const</span> dVector3 a, <span class="keyword">const</span> dVector3 b)
193<a name="l00178"></a>00178    { <span class="keywordflow">return</span> dSqrt( (a[0]-b[0])*(a[0]-b[0]) + (a[1]-b[1])*(a[1]-b[1]) + (a[2]-b[2])*(a[2]-b[2]) ); }
194<a name="l00179"></a>00179 <span class="preprocessor">#else</span>
195<a name="l00180"></a>00180 <span class="preprocessor"></span><span class="preprocessor">#define dDISTANCE(a,b) \</span>
196<a name="l00181"></a>00181 <span class="preprocessor">   (dSqrt( ((a)[0]-(b)[0])*((a)[0]-(b)[0]) + ((a)[1]-(b)[1])*((a)[1]-(b)[1]) + ((a)[2]-(b)[2])*((a)[2]-(b)[2]) ))</span>
197<a name="l00182"></a>00182 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
198<a name="l00183"></a>00183 <span class="preprocessor"></span>
199<a name="l00184"></a>00184
200<a name="l00185"></a>00185 <span class="comment">/*</span>
201<a name="l00186"></a>00186 <span class="comment"> * special case matrix multipication, with operator selection</span>
202<a name="l00187"></a>00187 <span class="comment"> */</span>
203<a name="l00188"></a>00188
204<a name="l00189"></a>00189 <span class="preprocessor">#define dMULTIPLYOP0_331(A,op,B,C) \</span>
205<a name="l00190"></a>00190 <span class="preprocessor">do { \</span>
206<a name="l00191"></a>00191 <span class="preprocessor">  (A)[0] op dDOT((B),(C)); \</span>
207<a name="l00192"></a>00192 <span class="preprocessor">  (A)[1] op dDOT((B+4),(C)); \</span>
208<a name="l00193"></a>00193 <span class="preprocessor">  (A)[2] op dDOT((B+8),(C)); \</span>
209<a name="l00194"></a>00194 <span class="preprocessor">} while(0)</span>
210<a name="l00195"></a>00195 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYOP1_331(A,op,B,C) \</span>
211<a name="l00196"></a>00196 <span class="preprocessor">do { \</span>
212<a name="l00197"></a>00197 <span class="preprocessor">  (A)[0] op dDOT41((B),(C)); \</span>
213<a name="l00198"></a>00198 <span class="preprocessor">  (A)[1] op dDOT41((B+1),(C)); \</span>
214<a name="l00199"></a>00199 <span class="preprocessor">  (A)[2] op dDOT41((B+2),(C)); \</span>
215<a name="l00200"></a>00200 <span class="preprocessor">} while(0)</span>
216<a name="l00201"></a>00201 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYOP0_133(A,op,B,C) \</span>
217<a name="l00202"></a>00202 <span class="preprocessor">do { \</span>
218<a name="l00203"></a>00203 <span class="preprocessor">  (A)[0] op dDOT14((B),(C)); \</span>
219<a name="l00204"></a>00204 <span class="preprocessor">  (A)[1] op dDOT14((B),(C+1)); \</span>
220<a name="l00205"></a>00205 <span class="preprocessor">  (A)[2] op dDOT14((B),(C+2)); \</span>
221<a name="l00206"></a>00206 <span class="preprocessor">} while(0)</span>
222<a name="l00207"></a>00207 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYOP0_333(A,op,B,C) \</span>
223<a name="l00208"></a>00208 <span class="preprocessor">do { \</span>
224<a name="l00209"></a>00209 <span class="preprocessor">  (A)[0] op dDOT14((B),(C)); \</span>
225<a name="l00210"></a>00210 <span class="preprocessor">  (A)[1] op dDOT14((B),(C+1)); \</span>
226<a name="l00211"></a>00211 <span class="preprocessor">  (A)[2] op dDOT14((B),(C+2)); \</span>
227<a name="l00212"></a>00212 <span class="preprocessor">  (A)[4] op dDOT14((B+4),(C)); \</span>
228<a name="l00213"></a>00213 <span class="preprocessor">  (A)[5] op dDOT14((B+4),(C+1)); \</span>
229<a name="l00214"></a>00214 <span class="preprocessor">  (A)[6] op dDOT14((B+4),(C+2)); \</span>
230<a name="l00215"></a>00215 <span class="preprocessor">  (A)[8] op dDOT14((B+8),(C)); \</span>
231<a name="l00216"></a>00216 <span class="preprocessor">  (A)[9] op dDOT14((B+8),(C+1)); \</span>
232<a name="l00217"></a>00217 <span class="preprocessor">  (A)[10] op dDOT14((B+8),(C+2)); \</span>
233<a name="l00218"></a>00218 <span class="preprocessor">} while(0)</span>
234<a name="l00219"></a>00219 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYOP1_333(A,op,B,C) \</span>
235<a name="l00220"></a>00220 <span class="preprocessor">do { \</span>
236<a name="l00221"></a>00221 <span class="preprocessor">  (A)[0] op dDOT44((B),(C)); \</span>
237<a name="l00222"></a>00222 <span class="preprocessor">  (A)[1] op dDOT44((B),(C+1)); \</span>
238<a name="l00223"></a>00223 <span class="preprocessor">  (A)[2] op dDOT44((B),(C+2)); \</span>
239<a name="l00224"></a>00224 <span class="preprocessor">  (A)[4] op dDOT44((B+1),(C)); \</span>
240<a name="l00225"></a>00225 <span class="preprocessor">  (A)[5] op dDOT44((B+1),(C+1)); \</span>
241<a name="l00226"></a>00226 <span class="preprocessor">  (A)[6] op dDOT44((B+1),(C+2)); \</span>
242<a name="l00227"></a>00227 <span class="preprocessor">  (A)[8] op dDOT44((B+2),(C)); \</span>
243<a name="l00228"></a>00228 <span class="preprocessor">  (A)[9] op dDOT44((B+2),(C+1)); \</span>
244<a name="l00229"></a>00229 <span class="preprocessor">  (A)[10] op dDOT44((B+2),(C+2)); \</span>
245<a name="l00230"></a>00230 <span class="preprocessor">} while(0)</span>
246<a name="l00231"></a>00231 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYOP2_333(A,op,B,C) \</span>
247<a name="l00232"></a>00232 <span class="preprocessor">do { \</span>
248<a name="l00233"></a>00233 <span class="preprocessor">  (A)[0] op dDOT((B),(C)); \</span>
249<a name="l00234"></a>00234 <span class="preprocessor">  (A)[1] op dDOT((B),(C+4)); \</span>
250<a name="l00235"></a>00235 <span class="preprocessor">  (A)[2] op dDOT((B),(C+8)); \</span>
251<a name="l00236"></a>00236 <span class="preprocessor">  (A)[4] op dDOT((B+4),(C)); \</span>
252<a name="l00237"></a>00237 <span class="preprocessor">  (A)[5] op dDOT((B+4),(C+4)); \</span>
253<a name="l00238"></a>00238 <span class="preprocessor">  (A)[6] op dDOT((B+4),(C+8)); \</span>
254<a name="l00239"></a>00239 <span class="preprocessor">  (A)[8] op dDOT((B+8),(C)); \</span>
255<a name="l00240"></a>00240 <span class="preprocessor">  (A)[9] op dDOT((B+8),(C+4)); \</span>
256<a name="l00241"></a>00241 <span class="preprocessor">  (A)[10] op dDOT((B+8),(C+8)); \</span>
257<a name="l00242"></a>00242 <span class="preprocessor">} while(0)</span>
258<a name="l00243"></a>00243 <span class="preprocessor"></span>
259<a name="l00244"></a>00244 <span class="preprocessor">#ifdef __cplusplus</span>
260<a name="l00245"></a>00245 <span class="preprocessor"></span>
261<a name="l00246"></a>00246 <span class="preprocessor">#define DECL template &lt;class TA, class TB, class TC&gt; PURE_INLINE void</span>
262<a name="l00247"></a>00247 <span class="preprocessor"></span>
263<a name="l00248"></a>00248 DECL dMULTIPLY0_331(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP0_331(A,=,B,C); }
264<a name="l00249"></a>00249 DECL dMULTIPLY1_331(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP1_331(A,=,B,C); }
265<a name="l00250"></a>00250 DECL dMULTIPLY0_133(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP0_133(A,=,B,C); }
266<a name="l00251"></a>00251 DECL dMULTIPLY0_333(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP0_333(A,=,B,C); }
267<a name="l00252"></a>00252 DECL dMULTIPLY1_333(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP1_333(A,=,B,C); }
268<a name="l00253"></a>00253 DECL dMULTIPLY2_333(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP2_333(A,=,B,C); }
269<a name="l00254"></a>00254
270<a name="l00255"></a>00255 DECL dMULTIPLYADD0_331(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP0_331(A,+=,B,C); }
271<a name="l00256"></a>00256 DECL dMULTIPLYADD1_331(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP1_331(A,+=,B,C); }
272<a name="l00257"></a>00257 DECL dMULTIPLYADD0_133(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP0_133(A,+=,B,C); }
273<a name="l00258"></a>00258 DECL dMULTIPLYADD0_333(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP0_333(A,+=,B,C); }
274<a name="l00259"></a>00259 DECL dMULTIPLYADD1_333(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP1_333(A,+=,B,C); }
275<a name="l00260"></a>00260 DECL dMULTIPLYADD2_333(TA *A, <span class="keyword">const</span> TB *B, <span class="keyword">const</span> TC *C) { dMULTIPLYOP2_333(A,+=,B,C); }
276<a name="l00261"></a>00261
277<a name="l00262"></a>00262 <span class="preprocessor">#undef DECL</span>
278<a name="l00263"></a>00263 <span class="preprocessor"></span>
279<a name="l00264"></a>00264 <span class="preprocessor">#else</span>
280<a name="l00265"></a>00265 <span class="preprocessor"></span>
281<a name="l00266"></a>00266 <span class="preprocessor">#define dMULTIPLY0_331(A,B,C) dMULTIPLYOP0_331(A,=,B,C)</span>
282<a name="l00267"></a>00267 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLY1_331(A,B,C) dMULTIPLYOP1_331(A,=,B,C)</span>
283<a name="l00268"></a>00268 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLY0_133(A,B,C) dMULTIPLYOP0_133(A,=,B,C)</span>
284<a name="l00269"></a>00269 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLY0_333(A,B,C) dMULTIPLYOP0_333(A,=,B,C)</span>
285<a name="l00270"></a>00270 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLY1_333(A,B,C) dMULTIPLYOP1_333(A,=,B,C)</span>
286<a name="l00271"></a>00271 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLY2_333(A,B,C) dMULTIPLYOP2_333(A,=,B,C)</span>
287<a name="l00272"></a>00272 <span class="preprocessor"></span>
288<a name="l00273"></a>00273 <span class="preprocessor">#define dMULTIPLYADD0_331(A,B,C) dMULTIPLYOP0_331(A,+=,B,C)</span>
289<a name="l00274"></a>00274 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYADD1_331(A,B,C) dMULTIPLYOP1_331(A,+=,B,C)</span>
290<a name="l00275"></a>00275 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYADD0_133(A,B,C) dMULTIPLYOP0_133(A,+=,B,C)</span>
291<a name="l00276"></a>00276 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYADD0_333(A,B,C) dMULTIPLYOP0_333(A,+=,B,C)</span>
292<a name="l00277"></a>00277 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYADD1_333(A,B,C) dMULTIPLYOP1_333(A,+=,B,C)</span>
293<a name="l00278"></a>00278 <span class="preprocessor"></span><span class="preprocessor">#define dMULTIPLYADD2_333(A,B,C) dMULTIPLYOP2_333(A,+=,B,C)</span>
294<a name="l00279"></a>00279 <span class="preprocessor"></span>
295<a name="l00280"></a>00280 <span class="preprocessor">#endif</span>
296<a name="l00281"></a>00281 <span class="preprocessor"></span>
297<a name="l00282"></a>00282
298<a name="l00283"></a>00283 <span class="preprocessor">#ifdef __cplusplus</span>
299<a name="l00284"></a>00284 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> {
300<a name="l00285"></a>00285 <span class="preprocessor">#endif</span>
301<a name="l00286"></a>00286 <span class="preprocessor"></span>
302<a name="l00287"></a>00287 <span class="comment">/*</span>
303<a name="l00288"></a>00288 <span class="comment"> * normalize 3x1 and 4x1 vectors (i.e. scale them to unit length)</span>
304<a name="l00289"></a>00289 <span class="comment"> */</span>
305<a name="l00290"></a>00290 ODE_API <span class="keywordtype">int</span>  dSafeNormalize3 (dVector3 a);
306<a name="l00291"></a>00291 ODE_API <span class="keywordtype">int</span>  dSafeNormalize4 (dVector4 a);
307<a name="l00292"></a>00292
308<a name="l00293"></a>00293 <span class="comment">// For some reason demo_chain1.c does not understand "inline" keyword.</span>
309<a name="l00294"></a>00294 <span class="keyword">static</span> __inline <span class="keywordtype">void</span> _dNormalize3(dVector3 a)
310<a name="l00295"></a>00295 {
311<a name="l00296"></a>00296    <span class="keywordtype">int</span> bNormalizationResult = dSafeNormalize3(a);
312<a name="l00297"></a>00297    dIASSERT(bNormalizationResult);
313<a name="l00298"></a>00298    dVARIABLEUSED(bNormalizationResult);
314<a name="l00299"></a>00299 }
315<a name="l00300"></a>00300
316<a name="l00301"></a>00301 <span class="keyword">static</span> __inline <span class="keywordtype">void</span> _dNormalize4(dVector4 a)
317<a name="l00302"></a>00302 {
318<a name="l00303"></a>00303    <span class="keywordtype">int</span> bNormalizationResult = dSafeNormalize4(a);
319<a name="l00304"></a>00304    dIASSERT(bNormalizationResult);
320<a name="l00305"></a>00305    dVARIABLEUSED(bNormalizationResult);
321<a name="l00306"></a>00306 }
322<a name="l00307"></a>00307
323<a name="l00308"></a>00308 <span class="comment">// For DLL export</span>
324<a name="l00309"></a>00309 ODE_API <span class="keywordtype">void</span> dNormalize3 (dVector3 a); <span class="comment">// Potentially asserts on zero vec</span>
325<a name="l00310"></a>00310 ODE_API <span class="keywordtype">void</span> dNormalize4 (dVector4 a); <span class="comment">// Potentially asserts on zero vec</span>
326<a name="l00311"></a>00311
327<a name="l00312"></a>00312 <span class="comment">// For internal use</span>
328<a name="l00313"></a>00313 <span class="preprocessor">#define dNormalize3(a) _dNormalize3(a)</span>
329<a name="l00314"></a>00314 <span class="preprocessor"></span><span class="preprocessor">#define dNormalize4(a) _dNormalize4(a)</span>
330<a name="l00315"></a>00315 <span class="preprocessor"></span>
331<a name="l00316"></a>00316 <span class="comment">/*</span>
332<a name="l00317"></a>00317 <span class="comment"> * given a unit length "normal" vector n, generate vectors p and q vectors</span>
333<a name="l00318"></a>00318 <span class="comment"> * that are an orthonormal basis for the plane space perpendicular to n.</span>
334<a name="l00319"></a>00319 <span class="comment"> * i.e. this makes p,q such that n,p,q are all perpendicular to each other.</span>
335<a name="l00320"></a>00320 <span class="comment"> * q will equal n x p. if n is not unit length then p will be unit length but</span>
336<a name="l00321"></a>00321 <span class="comment"> * q wont be.</span>
337<a name="l00322"></a>00322 <span class="comment"> */</span>
338<a name="l00323"></a>00323
339<a name="l00324"></a>00324 ODE_API <span class="keywordtype">void</span> dPlaneSpace (<span class="keyword">const</span> dVector3 n, dVector3 p, dVector3 q);
340<a name="l00325"></a>00325
341<a name="l00326"></a>00326 <span class="preprocessor">#ifdef __cplusplus</span>
342<a name="l00327"></a>00327 <span class="preprocessor"></span>}
343<a name="l00328"></a>00328 <span class="preprocessor">#endif</span>
344<a name="l00329"></a>00329 <span class="preprocessor"></span>
345<a name="l00330"></a>00330 <span class="preprocessor">#endif</span>
346</pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Fri Oct 12 08:36:51 2007 for Open Dynamics Engine by&nbsp;
347<a href="http://www.doxygen.org/index.html">
348<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.3 </small></address>
349</body>
350</html>
Note: See TracBrowser for help on using the repository browser.