test.h

来自「一个DSP的示例程序」· C头文件 代码 · 共 83 行

/* This is a test for sub: tst1 */
#define NX 4
#define FNAME "t2"
#define MAXERROR 2

#define SUB_SCALE 1

DATA x[NX] ={
3276,
6553,
9830,
13107,
};

DATA y[NX] ={
328,
655,
983,
1311,
};

DATA rtest[NX] ={
1475,
2949,
4424,
5898,
};

DATA r[NX]; 

short Xor (short Num_a, short Num_b)
{
	return (Num_a == Num_b)?0:1;
}

#define STACK_INIT_SIZE  10;     //存储空间初始分配量
#define STACKINCREMENT  10;      //存储空间分配变量
typedef struct
{
	 short *base;
	 short *top;
	 short  stacksize;
} SqStack;

short InitStack (SqStack &S)
{
	S.base = (short*) malloc (STACK_INIT_SIZE * sizeof(short));
	if (!S.base)
	{
		exit (OVERFLOW);       //存储分配失败
	} 	
	S.top = S.base;
	S.stacksize = STACK_INIT_SIZE;
	return 1;
}

short GetTop (SqStack S, short &e)
{
     if (S.top == S.base)    return 0;
     e = *(S.top - 1);
     return e;
}

short Push (SqStack &S, short e)
{
	if (S.top - S.base >= S.stacksize)   //栈满，追加存储空间
	{
		S.base = (short *) realloc (S.base, (S.stacksize + STACKINCREMENT) * sizeof
(short));
		if (!S.base)  exit(OVERFLOW);    //存储分配失败
		S.top = S.base + S.stacksize;
		S.stacksize += STACKINCREMENT;
	}
	*S.top ++ = e;
	return 1;
}

bool Pop (SqStack &S, short &e)
{
	if (S.top == S.base) return 0;
	e = *--S.top;
	return 1;
}