Removed spaces around assignment operators in C source

aimukhin · Nov 15, 2019 · c7f96d6 · c7f96d6
1 parent 9c62010
commit c7f96d6
Show file tree

Hide file tree

Showing 4 changed files with 1,134 additions and 1,134 deletions.
diff --git a/machdep/neon-single/mkaux_dft_1d.c b/machdep/neon-single/mkaux_dft_1d.c
@@ -23,40 +23,40 @@ minfft_mkaux_dft_1d (int N) {
 	if (N<=0 || N&(N-1))
 		// error if N is negative or not a power of two
 		return NULL;
-	a = malloc(sizeof(minfft_aux));
+	a=malloc(sizeof(minfft_aux));
 	if (a==NULL)
 		goto err;
-	a->N = N;
+	a->N=N;
 	if (N>=16) {
-		a->t = malloc(N*sizeof(minfft_cmpl));
+		a->t=malloc(N*sizeof(minfft_cmpl));
 		if (a->t==NULL)
 			goto err;
-		a->e = malloc(N*sizeof(minfft_cmpl));
+		a->e=malloc(N*sizeof(minfft_cmpl));
 		if (a->e==NULL)
 			goto err;
-		e = a->e;
+		e=a->e;
 		while (N>=16) {
 			for (n=0; n<N/4; n+=2) {
-				e1 = exp(-2*pi*I*n/N);
-				e1n = exp(-2*pi*I*(n+1)/N);
-				e3 = exp(-2*pi*I*3*n/N);
-				e3n = exp(-2*pi*I*3*(n+1)/N);
-				*e++ = creal(e1);
-				*e++ = creal(e1n);
-				*e++ = creal(e3);
-				*e++ = creal(e3n);
-				*e++ = cimag(e1);
-				*e++ = cimag(e1n);
-				*e++ = cimag(e3);
-				*e++ = cimag(e3n);
+				e1=exp(-2*pi*I*n/N);
+				e1n=exp(-2*pi*I*(n+1)/N);
+				e3=exp(-2*pi*I*3*n/N);
+				e3n=exp(-2*pi*I*3*(n+1)/N);
+				*e++=creal(e1);
+				*e++=creal(e1n);
+				*e++=creal(e3);
+				*e++=creal(e3n);
+				*e++=cimag(e1);
+				*e++=cimag(e1n);
+				*e++=cimag(e3);
+				*e++=cimag(e3n);
 			}
 			N /= 2;
 		}
 	} else {
-		a->t = NULL;
-		a->e = NULL;
+		a->t=NULL;
+		a->e=NULL;
 	}
-	a->sub1 = a->sub2 = NULL;
+	a->sub1=a->sub2=NULL;
 	return a;
 err:	// memory allocation error
 	minfft_free_aux(a);

diff --git a/machdep/sse3-single/mkaux_dft_1d.c b/machdep/sse3-single/mkaux_dft_1d.c
@@ -22,32 +22,32 @@ minfft_mkaux_dft_1d (int N) {
 	if (N<=0 || N&(N-1))
 		// error if N is negative or not a power of two
 		return NULL;
-	a = malloc(sizeof(minfft_aux));
+	a=malloc(sizeof(minfft_aux));
 	if (a==NULL)
 		goto err;
-	a->N = N;
+	a->N=N;
 	if (N>=16) {
-		a->t = malloc(N*sizeof(minfft_cmpl));
+		a->t=malloc(N*sizeof(minfft_cmpl));
 		if (a->t==NULL)
 			goto err;
-		a->e = malloc(N*sizeof(minfft_cmpl));
+		a->e=malloc(N*sizeof(minfft_cmpl));
 		if (a->e==NULL)
 			goto err;
-		e = a->e;
+		e=a->e;
 		while (N>=16) {
 			for (n=0; n<N/4; n+=2) {
-				*e++ = exp(-2*pi*I*n/N);
-				*e++ = exp(-2*pi*I*(n+1)/N);
-				*e++ = exp(-2*pi*I*3*n/N);
-				*e++ = exp(-2*pi*I*3*(n+1)/N);
+				*e++=exp(-2*pi*I*n/N);
+				*e++=exp(-2*pi*I*(n+1)/N);
+				*e++=exp(-2*pi*I*3*n/N);
+				*e++=exp(-2*pi*I*3*(n+1)/N);
 			}
 			N /= 2;
 		}
 	} else {
-		a->t = NULL;
-		a->e = NULL;
+		a->t=NULL;
+		a->e=NULL;
 	}
-	a->sub1 = a->sub2 = NULL;
+	a->sub1=a->sub2=NULL;
 	return a;
 err:	// memory allocation error
 	minfft_free_aux(a);