Chris@69
|
1 /* Copyright (c) 2011 Xiph.Org Foundation
|
Chris@69
|
2 Written by Gregory Maxwell */
|
Chris@69
|
3 /*
|
Chris@69
|
4 Redistribution and use in source and binary forms, with or without
|
Chris@69
|
5 modification, are permitted provided that the following conditions
|
Chris@69
|
6 are met:
|
Chris@69
|
7
|
Chris@69
|
8 - Redistributions of source code must retain the above copyright
|
Chris@69
|
9 notice, this list of conditions and the following disclaimer.
|
Chris@69
|
10
|
Chris@69
|
11 - Redistributions in binary form must reproduce the above copyright
|
Chris@69
|
12 notice, this list of conditions and the following disclaimer in the
|
Chris@69
|
13 documentation and/or other materials provided with the distribution.
|
Chris@69
|
14
|
Chris@69
|
15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
Chris@69
|
16 ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
Chris@69
|
17 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
Chris@69
|
18 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
|
Chris@69
|
19 OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
Chris@69
|
20 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
Chris@69
|
21 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
Chris@69
|
22 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
Chris@69
|
23 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
Chris@69
|
24 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
Chris@69
|
25 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
Chris@69
|
26 */
|
Chris@69
|
27
|
Chris@69
|
28 static OPUS_INLINE void deb2_impl(unsigned char *_t,unsigned char **_p,int _k,int _x,int _y)
|
Chris@69
|
29 {
|
Chris@69
|
30 int i;
|
Chris@69
|
31 if(_x>2){
|
Chris@69
|
32 if(_y<3)for(i=0;i<_y;i++)*(--*_p)=_t[i+1];
|
Chris@69
|
33 }else{
|
Chris@69
|
34 _t[_x]=_t[_x-_y];
|
Chris@69
|
35 deb2_impl(_t,_p,_k,_x+1,_y);
|
Chris@69
|
36 for(i=_t[_x-_y]+1;i<_k;i++){
|
Chris@69
|
37 _t[_x]=i;
|
Chris@69
|
38 deb2_impl(_t,_p,_k,_x+1,_x);
|
Chris@69
|
39 }
|
Chris@69
|
40 }
|
Chris@69
|
41 }
|
Chris@69
|
42
|
Chris@69
|
43 /*Generates a De Bruijn sequence (k,2) with length k^2*/
|
Chris@69
|
44 static OPUS_INLINE void debruijn2(int _k, unsigned char *_res)
|
Chris@69
|
45 {
|
Chris@69
|
46 unsigned char *p;
|
Chris@69
|
47 unsigned char *t;
|
Chris@69
|
48 t=malloc(sizeof(unsigned char)*_k*2);
|
Chris@69
|
49 memset(t,0,sizeof(unsigned char)*_k*2);
|
Chris@69
|
50 p=&_res[_k*_k];
|
Chris@69
|
51 deb2_impl(t,&p,_k,1,1);
|
Chris@69
|
52 free(t);
|
Chris@69
|
53 }
|
Chris@69
|
54
|
Chris@69
|
55 /*MWC RNG of George Marsaglia*/
|
Chris@69
|
56 static opus_uint32 Rz, Rw;
|
Chris@69
|
57 static OPUS_INLINE opus_uint32 fast_rand(void)
|
Chris@69
|
58 {
|
Chris@69
|
59 Rz=36969*(Rz&65535)+(Rz>>16);
|
Chris@69
|
60 Rw=18000*(Rw&65535)+(Rw>>16);
|
Chris@69
|
61 return (Rz<<16)+Rw;
|
Chris@69
|
62 }
|
Chris@69
|
63 static opus_uint32 iseed;
|
Chris@69
|
64
|
Chris@69
|
65 #ifdef __GNUC__
|
Chris@69
|
66 __attribute__((noreturn))
|
Chris@69
|
67 #elif defined(_MSC_VER)
|
Chris@69
|
68 __declspec(noreturn)
|
Chris@69
|
69 #endif
|
Chris@69
|
70 static OPUS_INLINE void _test_failed(const char *file, int line)
|
Chris@69
|
71 {
|
Chris@69
|
72 fprintf(stderr,"\n ***************************************************\n");
|
Chris@69
|
73 fprintf(stderr," *** A fatal error was detected. ***\n");
|
Chris@69
|
74 fprintf(stderr," ***************************************************\n");
|
Chris@69
|
75 fprintf(stderr,"Please report this failure and include\n");
|
Chris@69
|
76 fprintf(stderr,"'make check SEED=%u fails %s at line %d for %s'\n",iseed,file,line,opus_get_version_string());
|
Chris@69
|
77 fprintf(stderr,"and any relevant details about your system.\n\n");
|
Chris@69
|
78 abort();
|
Chris@69
|
79 }
|
Chris@69
|
80 #define test_failed() _test_failed(__FILE__, __LINE__);
|
Chris@69
|
81
|
Chris@69
|
82 void regression_test(void);
|