ShuriZma
/
xemu
mirror of https://github.com/xemu-project/xemu.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

block/vvfat: Fix compiler warnings for OpenBSD 

The buildbot shows these compiler warnings:

block/vvfat.c: In function 'create_short_and_long_name':
block/vvfat.c:620: warning: array size (8) smaller than bound length (11)
block/vvfat.c:620: warning: array size (8) smaller than bound length (11)
block/vvfat.c:635: warning: array size (8) smaller than bound length (11)
block/vvfat.c:635: warning: array size (8) smaller than bound length (11)

They are caused by tricky code where 8 characters for the name are followed
by 3 characters for the extension, and some operations touch both name and
extension.

Using an 11 character name which includes the extension fixes the compiler
warning, satisfies cppcheck, valgrind and maybe other static and dynamic
code checkers, and even simplifies some parts of the code.

Signed-off-by: Stefan Weil <sw@weilnetz.de>
Reviewed-by: Stefan Hajnoczi <stefanha@redhat.com>
Signed-off-by: Kevin Wolf <kwolf@redhat.com>
This commit is contained in:
Stefan Weil 2013-12-11 21:37:11 +01:00 committed by Kevin Wolf
parent 01443e1388
commit f671d173c7
1 changed files with 22 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
block/vvfat.c
View File

@ -266,8 +266,7 @@ typedef struct mbr_t {
} QEMU_PACKED mbr_t; } QEMU_PACKED mbr_t;
typedef struct direntry_t { typedef struct direntry_t {
uint8_t name[8]; uint8_t name[8 + 3];
uint8_t extension[3];
uint8_t attributes; uint8_t attributes;
uint8_t reserved[2]; uint8_t reserved[2];
uint16_t ctime; uint16_t ctime;
@ -518,11 +517,9 @@ static inline uint8_t fat_chksum(const direntry_t* entry)
uint8_t chksum=0; uint8_t chksum=0;
int i; int i;
for(i=0;i<11;i++) { for (i = 0; i < ARRAY_SIZE(entry->name); i++) {
unsigned char c; chksum = (((chksum & 0xfe) >> 1) |
((chksum & 0x01) ? 0x80 : 0)) + entry->name[i];
c = (i < 8) ? entry->name[i] : entry->extension[i-8];
chksum=(((chksum&0xfe)>>1)|((chksum&0x01)?0x80:0)) + c;
} }
return chksum; return chksum;
@ -617,7 +614,7 @@ static inline direntry_t* create_short_and_long_name(BDRVVVFATState* s,
if(is_dot) { if(is_dot) {
entry=array_get_next(&(s->directory)); entry=array_get_next(&(s->directory));
memset(entry->name,0x20,11); memset(entry->name, 0x20, sizeof(entry->name));
memcpy(entry->name,filename,strlen(filename)); memcpy(entry->name,filename,strlen(filename));
return entry; return entry;
} }
@ -632,12 +629,14 @@ static inline direntry_t* create_short_and_long_name(BDRVVVFATState* s,
i = 8; i = 8;
entry=array_get_next(&(s->directory)); entry=array_get_next(&(s->directory));
memset(entry->name,0x20,11); memset(entry->name, 0x20, sizeof(entry->name));
memcpy(entry->name, filename, i); memcpy(entry->name, filename, i);
if(j > 0) if (j > 0) {
for (i = 0; i < 3 && filename[j+1+i]; i++) for (i = 0; i < 3 && filename[j + 1 + i]; i++) {
entry->extension[i] = filename[j+1+i]; entry->name[8 + i] = filename[j + 1 + i];
}
}
/* upcase & remove unwanted characters */ /* upcase & remove unwanted characters */
for(i=10;i>=0;i--) { for(i=10;i>=0;i--) {
@ -861,8 +860,7 @@ static int init_directories(BDRVVVFATState* s,
{ {
direntry_t* entry=array_get_next(&(s->directory)); direntry_t* entry=array_get_next(&(s->directory));
entry->attributes=0x28; /* archive | volume label */ entry->attributes=0x28; /* archive | volume label */
memcpy(entry->name,"QEMU VVF",8); memcpy(entry->name, "QEMU VVFAT ", sizeof(entry->name));
memcpy(entry->extension,"AT ",3);
} }
/* Now build FAT, and write back information into directory */ /* Now build FAT, and write back information into directory */
@ -1591,17 +1589,20 @@ static int parse_short_name(BDRVVVFATState* s,
lfn->name[i] = direntry->name[i]; lfn->name[i] = direntry->name[i];
} }
for (j = 2; j >= 0 && direntry->extension[j] == ' '; j--); for (j = 2; j >= 0 && direntry->name[8 + j] == ' '; j--) {
}
if (j >= 0) { if (j >= 0) {
lfn->name[i++] = '.'; lfn->name[i++] = '.';
lfn->name[i + j + 1] = '\0'; lfn->name[i + j + 1] = '\0';
for (;j >= 0; j--) { for (;j >= 0; j--) {
if (direntry->extension[j] <= ' ' || direntry->extension[j] > 0x7f) uint8_t c = direntry->name[8 + j];
return -2; if (c <= ' ' || c > 0x7f) {
else if (s->downcase_short_names) return -2;
lfn->name[i + j] = qemu_tolower(direntry->extension[j]); } else if (s->downcase_short_names) {
else lfn->name[i + j] = qemu_tolower(c);
lfn->name[i + j] = direntry->extension[j]; } else {
lfn->name[i + j] = c;
}
} }
} else } else
lfn->name[i + j + 1] = '\0'; lfn->name[i + j + 1] = '\0';