Mercurial > libavcodec.hg

comparison truemotion1.c @ 9985:266bf83f634d libavcodec

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Replace WORDS_BIGENDIAN with HAVE_BIGENDIAN
author mru
date Sun, 26 Jul 2009 12:20:04 +0000
parents 5da84f0d0a55
children 8a4984c5cacc
comparison
equal deleted inserted replaced
9984:32dfddd8992a 9985:266bf83f634d
161 s->ydt[i] &= 0xFFFE; 161 s->ydt[i] &= 0xFFFE;
162 s->ydt[i] /= 2; 162 s->ydt[i] /= 2;
163 } 163 }
164 } 164 }
165 165
166 #ifdef WORDS_BIGENDIAN 166 #if HAVE_BIGENDIAN
167 static int make_ydt15_entry(int p2, int p1, int16_t *ydt) 167 static int make_ydt15_entry(int p2, int p1, int16_t *ydt)
168 #else 168 #else
169 static int make_ydt15_entry(int p1, int p2, int16_t *ydt) 169 static int make_ydt15_entry(int p1, int p2, int16_t *ydt)
170 #endif 170 #endif
171 { 171 {
176 hi = ydt[p2]; 176 hi = ydt[p2];
177 hi += (hi << 5) + (hi << 10); 177 hi += (hi << 5) + (hi << 10);
178 return (lo + (hi << 16)) << 1; 178 return (lo + (hi << 16)) << 1;
179 } 179 }
180 180
181 #ifdef WORDS_BIGENDIAN 181 #if HAVE_BIGENDIAN
182 static int make_cdt15_entry(int p2, int p1, int16_t *cdt) 182 static int make_cdt15_entry(int p2, int p1, int16_t *cdt)
183 #else 183 #else
184 static int make_cdt15_entry(int p1, int p2, int16_t *cdt) 184 static int make_cdt15_entry(int p1, int p2, int16_t *cdt)
185 #endif 185 #endif
186 { 186 {
190 r = cdt[p1] << 10; 190 r = cdt[p1] << 10;
191 lo = b + r; 191 lo = b + r;
192 return (lo + (lo << 16)) << 1; 192 return (lo + (lo << 16)) << 1;
193 } 193 }
194 194
195 #ifdef WORDS_BIGENDIAN 195 #if HAVE_BIGENDIAN
196 static int make_ydt16_entry(int p2, int p1, int16_t *ydt) 196 static int make_ydt16_entry(int p2, int p1, int16_t *ydt)
197 #else 197 #else
198 static int make_ydt16_entry(int p1, int p2, int16_t *ydt) 198 static int make_ydt16_entry(int p1, int p2, int16_t *ydt)
199 #endif 199 #endif
200 { 200 {
205 hi = ydt[p2]; 205 hi = ydt[p2];
206 hi += (hi << 6) + (hi << 11); 206 hi += (hi << 6) + (hi << 11);
207 return (lo + (hi << 16)) << 1; 207 return (lo + (hi << 16)) << 1;
208 } 208 }
209 209
210 #ifdef WORDS_BIGENDIAN 210 #if HAVE_BIGENDIAN
211 static int make_cdt16_entry(int p2, int p1, int16_t *cdt) 211 static int make_cdt16_entry(int p2, int p1, int16_t *cdt)
212 #else 212 #else
213 static int make_cdt16_entry(int p1, int p2, int16_t *cdt) 213 static int make_cdt16_entry(int p1, int p2, int16_t *cdt)
214 #endif 214 #endif
215 { 215 {
219 r = cdt[p1] << 11; 219 r = cdt[p1] << 11;
220 lo = b + r; 220 lo = b + r;
221 return (lo + (lo << 16)) << 1; 221 return (lo + (lo << 16)) << 1;
222 } 222 }
223 223
224 #ifdef WORDS_BIGENDIAN 224 #if HAVE_BIGENDIAN
225 static int make_ydt24_entry(int p2, int p1, int16_t *ydt) 225 static int make_ydt24_entry(int p2, int p1, int16_t *ydt)
226 #else 226 #else
227 static int make_ydt24_entry(int p1, int p2, int16_t *ydt) 227 static int make_ydt24_entry(int p1, int p2, int16_t *ydt)
228 #endif 228 #endif
229 { 229 {
232 lo = ydt[p1]; 232 lo = ydt[p1];
233 hi = ydt[p2]; 233 hi = ydt[p2];
234 return (lo + (hi << 8) + (hi << 16)) << 1; 234 return (lo + (hi << 8) + (hi << 16)) << 1;
235 } 235 }
236 236
237 #ifdef WORDS_BIGENDIAN 237 #if HAVE_BIGENDIAN
238 static int make_cdt24_entry(int p2, int p1, int16_t *cdt) 238 static int make_cdt24_entry(int p2, int p1, int16_t *cdt)
239 #else 239 #else
240 static int make_cdt24_entry(int p1, int p2, int16_t *cdt) 240 static int make_cdt24_entry(int p1, int p2, int16_t *cdt)
241 #endif 241 #endif
242 { 242 {