From f1ea8d3be965182ae75549894b125708b7e6e5bf Mon Sep 17 00:00:00 2001 From: Jean Delvare Date: Sun, 26 Oct 2008 12:50:21 +0000 Subject: Mass coding-style change: add spaces around operators. --- ownership.c | 82 +++++++++++++++++++++++++++++++------------------------------ 1 file changed, 42 insertions(+), 40 deletions(-) (limited to 'ownership.c') diff --git a/ownership.c b/ownership.c index 8dfb461..901cbf4 100644 --- a/ownership.c +++ b/ownership.c @@ -43,13 +43,13 @@ /* Options are global */ struct opt { - const char* devmem; + const char *devmem; unsigned int flags; }; static struct opt opt; -#define FLAG_VERSION (1<<0) -#define FLAG_HELP (1<<1) +#define FLAG_VERSION (1 << 0) +#define FLAG_HELP (1 << 1) static void ownership(u32 base, const char *pname, const char *devmem) { @@ -57,25 +57,25 @@ static void ownership(u32 base, const char *pname, const char *devmem) int i; /* read the ownership tag */ - if((buf=mem_chunk(base, 0x51, devmem))==NULL) + if ((buf = mem_chunk(base, 0x51, devmem)) == NULL) { perror(pname); return; } /* chop the trailing garbage */ - i=0x4f; - while(i>=0 && (buf[i]==0x20 || buf[i]==0x00)) + i = 0x4f; + while (i >= 0 && (buf[i] == 0x20 || buf[i] == 0x00)) i--; - buf[i+1]='\0'; + buf[i + 1] = '\0'; /* filter and print */ - if(i>=0) + if (i >= 0) { - for(; i>=0; i--) + for (; i >= 0; i--) { - if(buf[i]<32 || (buf[i]>=127 && buf[i]<160)) - buf[i]='?'; + if (buf[i] < 32 || (buf[i] >= 127 && buf[i] < 160)) + buf[i] = '?'; } printf("%s\n", (char *)buf); } @@ -88,22 +88,24 @@ static u32 decode(const u8 *p) int i; /* integrity checking (lack of checksum) */ - for(i=0; i='A' && p[6+i*10]<='Z') - || !(p[7+i*10]>='A' && p[7+i*10]<='Z') - || !(p[8+i*10]>='A' && p[8+i*10]<='Z')) + if (p[5 + i * 10] != '$' + || !(p[6 + i * 10] >= 'A' && p[6 + i * 10] <= 'Z') + || !(p[7 + i * 10] >= 'A' && p[7 + i * 10] <= 'Z') + || !(p[8 + i * 10] >= 'A' && p[8 + i * 10] <= 'Z')) { printf("\t Abnormal Entry! Please report. [%02x %02x %02x %02x]\n", - p[5+i*10], p[6+i*10], p[7+i*10], p[8+i*10]); + p[5 + i * 10], p[6 + i * 10], + p[7 + i * 10], p[8 + i * 10]); return 0; } } /* search for the right entry */ - for(i=0; i