src/mainboard: Remove unnecessary whitespace

Change-Id: I35cb7e08d5233aa5a3dbb4631ab2ee4dc9596f98
Signed-off-by: Elyes HAOUAS <ehaouas@noos.fr>
Reviewed-on: https://review.coreboot.org/16849
Tested-by: build bot (Jenkins)
Reviewed-by: Martin Roth <martinroth@google.com>
This commit is contained in:
Elyes HAOUAS 2016-10-02 10:09:11 +02:00 committed by Martin Roth
parent 028200f75f
commit f2fcf22d22
15 changed files with 40 additions and 34 deletions

View File

@ -43,7 +43,8 @@ static unsigned int search(char *p, char *a, unsigned int lengthp,
/* Searching */
for (j = 0; j <= lengtha - lengthp; j++) {
for (i = 0; i < lengthp && p[i] == a[i + j]; i++) ;
for (i = 0; i < lengthp && p[i] == a[i + j]; i++)
;
if (i >= lengthp)
return j;
}

View File

@ -31,7 +31,8 @@ static unsigned int search(char *p, u8 *a, unsigned int lengthp,
/* Searching */
for (j = 0; j <= lengtha - lengthp; j++) {
for (i = 0; i < lengthp && p[i] == a[i + j]; i++) ;
for (i = 0; i < lengthp && p[i] == a[i + j]; i++)
;
if (i >= lengthp)
return j;
}

View File

@ -31,7 +31,8 @@ static unsigned int search(char *p, u8 *a, unsigned int lengthp,
/* Searching */
for (j = 0; j <= lengtha - lengthp; j++) {
for (i = 0; i < lengthp && p[i] == a[i + j]; i++) ;
for (i = 0; i < lengthp && p[i] == a[i + j]; i++)
;
if (i >= lengthp)
return j;
}

View File

@ -31,7 +31,8 @@ static unsigned int search(char *p, u8 *a, unsigned int lengthp,
/* Searching */
for (j = 0; j <= lengtha - lengthp; j++) {
for (i = 0; i < lengthp && p[i] == a[i + j]; i++) ;
for (i = 0; i < lengthp && p[i] == a[i + j]; i++)
;
if (i >= lengthp)
return j;
}

View File

@ -31,7 +31,8 @@ static unsigned int search(char *p, u8 *a, unsigned int lengthp,
/* Searching */
for (j = 0; j <= lengtha - lengthp; j++) {
for (i = 0; i < lengthp && p[i] == a[i + j]; i++) ;
for (i = 0; i < lengthp && p[i] == a[i + j]; i++)
;
if (i >= lengthp)
return j;
}

View File

@ -31,7 +31,8 @@ static unsigned int search(char *p, u8 *a, unsigned int lengthp,
/* Searching */
for (j = 0; j <= lengtha - lengthp; j++) {
for (i = 0; i < lengthp && p[i] == a[i + j]; i++) ;
for (i = 0; i < lengthp && p[i] == a[i + j]; i++)
;
if (i >= lengthp)
return j;
}