hallo,
ich kapier's nicht- ich bekomme Fehlermeldungen mit Verweis auf Zeilennummern, die überhaupt keinen entspechenden Code enthalten -
z.B. kommen M, K und N überhaupt nicht in Zeilen 11-12 vor!
Arduino: 1.5.6-r2 (Windows XP), Board: "Arduino Mega or Mega 2560, ATmega2560 (Mega 2560)"
ArduBench0002:11: error: 'M' was not declared in this scope
ArduBench0002:11: error: 'K' was not declared in this scope
ArduBench0002:11: error: 'K' was not declared in this scope
ArduBench0002:12: error: 'N' was not declared in this scope
ArduBench0002:12: error: 'N' was not declared in this scope
ArduBench0002.ino: In function 'long unsigned int randM()':
ArduBench0002:20: error: 'conast' was not declared in this scope
ArduBench0002:20: error: expected `;' before 'unsigned'
ArduBench0002:36: error: 'A' was not declared in this scope
ArduBench0002:38: error: 'A' was not declared in this scope
ArduBench0002.ino: At global scope:
ArduBench0002:55: error: 'M' was not declared in this scope
ArduBench0002:55: error: 'K' was not declared in this scope
ArduBench0002:55: error: 'K' was not declared in this scope
ArduBench0002.ino: In function 'void MatrixMatrixMult(int, int, int)'://... SNIP
was ist denn da los?
(ein anderes Programm mit serieller Ausgabe funktioniert übrigens einwandfrei.)
// version 1.08.0002
#define TimerMS() millis()
unsigned long runtime[8];
int a[500], b[500], c[500], t[500];
//--------------------------------------------
// Mersenne Twister
//--------------------------------------------
unsigned long randM(void) {
const int M = 7;
conast unsigned long A[2] = { 0, 0x8ebfd028 };
static unsigned long y[25];
static int index = 25+1;
if (index >= 25) {
int k;
if (index > 25) {
unsigned long r = 9, s = 3402;
for (k=0 ; k<25 ; ++k) {
r = 509845221 * r + 3;
s *= s + 1;
y[k] = s + (r >> 10);
}
}
for (k=0 ; k<25-M ; ++k)
y[k] = y[k+M] ^ (y[k] >> 1) ^ A[y[k] & 1];
for (; k<25 ; ++k)
y[k] = y[k+(M-25)] ^ (y[k] >> 1) ^ A[y[k] & 1];
index = 0;
}
unsigned long e = y[index++];
e ^= (e << 7) & 0x2b5b2500;
e ^= (e << 15) & 0xdb8b0000;
e ^= (e >> 16);
return e;
}
//--------------------------------------------
// Matrix Algebra
//--------------------------------------------
// matrix * matrix multiplication (matrix product)
void MatrixMatrixMult(int N, int M, int K, double A[][M], double B[][K], double C[][K]){
int i, j, s; // matrix A: N x M // B: M x K // C: N x K
for (i=0; i<N; ++i) {
for (j=0; j<K; ++j) {
C[i][j]=0;
for (s=0; s<M; ++s) {
C[i][j]=C[i][j] + A[i][s]*B[s][j];
}
}
}
}
// matrix determinant
double MatrixDet(int N, double A[N][N])
{
int i,j,i_count,j_count, count=0;
double Asub[N-1][N-1], det=0;
if(N==1) return A[0][0];
if(N==2) return (A[0][0]*A[1][1] - A[0][1]*A[1][0]);
for(count=0; count<N; count++)
{
i_count=0;
for(i=1; i<N; i++)
{
j_count=0;
for(j=0; j<N; j++)
{
if(j == count) continue;
Asub[i_count][j_count] = A[i][j];
j_count++;
}
i_count++;
}
det += pow(-1, count) * A[0][count] * MatrixDet(N-1,Asub);
}
return det;
}
//--------------------------------------------
// shell sort
//--------------------------------------------
void shellsort(int size, int* A)
{
int i, j, increment;
int temp;
increment = size / 2;
while (increment > 0) {
for (i = increment; i < size; i++) {
j = i;
temp = A[i];
while ((j >= increment) && (A[j-increment] > temp)) {
A[j] = A[j - increment];
j = j - increment;
}
A[j] = temp;
}
if (increment == 2)
increment = 1;
else
increment = (unsigned int) (increment / 2.2);
}
}
//--------------------------------------------
// gnu quick sort
// (0ptional)
//--------------------------------------------
int compare_int (const int *a, const int *b)
{
int temp = *a - *b;
if (temp > 0) return 1;
else if (temp < 0) return -1;
else return 0;
}
// gnu qsort:
// void qsort (void *a , size_a count, size_a size, compare_function)
// gnu qsort call for a[500] array of int:
// qsort (a , 500, sizeof(a), compare_int)
//--------------------------------------------
// benchmark test procedures
//--------------------------------------------
int test_Int_Add() {
int i=1, j=11, k=112, l=1111, m=11111, n=-1, o=-11, p=-111, q=-1112, r=-11111;
int x;
volatile long s=0;
for(x=0;x<10000;++x) {
s+=i; s+=j; s+=k; s+=l; s+=m; s+=n; s+=o; s+=p; s+=q; s+=r;
}
return s;
}
long test_Int_Mult() {
int x,y;
volatile long s;
for(y=0;y<2000;++y) {
s=1;
for(x=1;x<=13;++x) { s*=x;}
for(x=13;x>0;--x) { s/=x;}
}
return s;
}
#define PI M_PI
float test_float_math() {
volatile float s=PI;
int y;
for(y=0;y<5000;++y) {
s*=sqrt(s);
s=sin(s);
s*=cos(10.5*s);
s=sqrt(s);
s=exp(s);
}
return s;
}
long test_rand_MT(){
volatile unsigned long s;
int y;
for(y=0;y<5000;++y) {
s=randM()%10001;
}
return s;
}
float test_matrix_math() {
int x;
double A[2][2], B[2][2], C[2][2];
double O[3][3], T[3][3];
unsigned long s;
for(x=0;x<250;++x) {
A[0][0]=1; A[0][1]=3;
A[1][0]=2; A[1][1]=4;
B[0][0]=10; B[0][1]=30;
B[1][0]=20; B[1][1]=40;
MatrixMatrixMult(2,2,2, A,B,C);
A[0][0]=1; A[0][1]=3;
A[1][0]=2; A[1][1]=4;
MatrixDet(2, A);
O[0][0]=1; O[0][1]=4; O[0][2]=7;
O[1][0]=2; O[1][1]=5; O[1][2]=8;
O[2][0]=3; O[2][1]=6; O[2][2]=9;
MatrixDet(3, O);
}
s=(O[0][0]*O[1][1]*O[2][2]);
return s;
}
// for array copy using void *memcpy(void *dest, const void *src, size_t n);
long test_Sort(){
unsigned long s;
int y, i;
int t[500];
for(y=0;y<30;++y) {
memcpy(t, a, sizeof(a));
shellsort(500, t);
memcpy(t, a, sizeof(b));
shellsort(500, t);
memcpy(t, a, sizeof(c));
shellsort(500, t);
}
return y;
}
inline void displayValues() {
char buf[120];
sprintf (buf, "%3d %4d int_Add", 0, runtime[0]); serial.println( buf);
sprintf (buf, "%3d %4d int_Mult", 1, runtime[1]); serial.println( buf);
sprintf (buf, "%3d %4d float_op", 2, runtime[2]); serial.println( buf);
sprintf (buf, "%3d %4d randomize", 3, runtime[3]); serial.println( buf);
sprintf (buf, "%3d %4d matrx_algb", 4, runtime[4]); serial.println( buf);
sprintf (buf, "%3d %4d arr_sort", 5, runtime[5]); serial.println( buf);
sprintf (buf, "%3d %4d displ_txt", 6, runtime[6]); serial.println( buf);
sprintf (buf, "%3d %4d graphics", 7, 99999); serial.println( buf);
sprintf (buf, "%3d %4d graphics", 8, 99999); serial.println( buf);
}
void Handler(int sig) /// ???
{
//printf("handler %d\n", sig); /// ???
}
int test(){
unsigned long time0, x, y;
float s;
char buf[120];
int i;
for(y=0;y<500;++y) {
a[y]=randM()%30000; b[y]=randM()%30000; c[y]=randM()%30000;
}
// LcdClearDisplay();
time0= TimerMS();;
s=test_Int_Add();
runtime[0]=TimerMS()-time0;
sprintf (buf, "%3d %4d int_Add", 0, runtime[0]); serial.println( buf);
time0=TimerMS();
s=test_Int_Mult();
runtime[1]=TimerMS()-time0;
sprintf (buf, "%3d %4d int_Mult", 0, runtime[1]); serial.println( buf);
time0=TimerMS();
s=test_float_math();
runtime[2]=TimerMS()-time0;
sprintf (buf, "%3d %4d float_op", 0, runtime[2]); serial.println( buf);
time0=TimerMS();
s=test_rand_MT();
runtime[3]=TimerMS()-time0;
sprintf (buf, "%3d %4d randomize", 0, runtime[3]); serial.println( buf);
time0=TimerMS();
s=test_matrix_math();
runtime[4]=TimerMS()-time0;
sprintf (buf, "%3d %4d matrx_algb", 0, runtime[4]); serial.println( buf);
time0=TimerMS();
s=test_Sort();
runtime[5]=TimerMS()-time0;
sprintf (buf, "%3d %4d arr_sort", 0, runtime[5]); serial.println( buf);
serial.println();
sprintf (buf, "gesamt ms: %d ", y); serial.println( buf);
sprintf (buf, "benchmark: %d ", 50000000/y ); serial.println( buf);
return 1;
}
void setup() {
// put your setup code here, to run once:
Serial.begin(9600);
}
void loop() {
// put your main code here, to run repeatedly:
//test();
sprintf (buf, "Ende HaWe brickbench"); serial.println( buf);
while(1);
}
