Emulation/switch-coreboot
1
0
Fork 0
mirror of https://github.com/fail0verflow/switch-coreboot.git synced 2025-05-04 01:39:18 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix warnings (trivial)

Browse source 
Signed-off-by: Stefan Reinauer <stepan@coresystems.de>
Acked-by: Stefan Reinauer <stepan@coresystems.de>



git-svn-id: svn://coreboot.org/repository/LinuxBIOSv3@193 f3766cd6-281f-0410-b1cd-43a5c92072e9
This commit is contained in:
Stefan Reinauer 2007-03-05 22:01:28 +00:00
parent 022cd22f5d
commit ed26e22f02
4 changed files with 7 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
device/device.c
View file

@ -670,7 +670,7 @@ unsigned int dev_phase3_scan(struct device * busdevice, unsigned int max)
{
printk(BIOS_INFO, "%s: %s: busdevice %p enabled %d ops %p\n" , __FUNCTION__,
busdevice->dtsname,
busdevice, busdevice ? busdevice->enabled : NULL,
busdevice, busdevice ? busdevice->enabled : 0,
busdevice ? busdevice->ops : NULL);
printk(BIOS_INFO, "%s: can not scan from here, returning %d\n", __FUNCTION__, max);
return max;

2
device/pci_device.c
View file

@ -779,7 +779,9 @@ static struct device_operations *get_pci_bridge_ops(struct device * dev)
*/
static void set_pci_ops(struct device *dev)
{
#if 0
struct pci_driver *driver;
#endif
if (dev->ops) {
printk(BIOS_INFO, "%s: dev %p(%s) already has ops %p\n", __func__, dev, dev->dtsname, dev->ops);
return;

6
util/dtc/flattree.c
View file

@ -1062,8 +1062,8 @@ void dt_to_C(FILE *f, struct boot_info *bi, int version, int boot_cpuid_phys)
*/
fprintf(f, "\tu64 reservemap[] = {\n");
for (re = bi->reservelist; re; re = re->next) {
fprintf(f, "\tu64\t0x%qx\n", re->re.address);
fprintf(f, "\tu64\t0x%qx\n", re->re.size);
fprintf(f, "\tu64\t0x%lx\n", re->re.address);
fprintf(f, "\tu64\t0x%lx\n", re->re.size);
}
@ -1103,7 +1103,7 @@ labeltree(struct node *tree)
/* the root, weirdly enough, is last on the 'next' chain. yuck. */
void fix_next(struct node *root){
extern struct node *first_node;
struct node *next2last, *next;
struct node *next2last=NULL, *next;
for(next = first_node; next; next = next->next)
if (next->next == root)
next2last = next;

2
util/lar/list.c
View file

@ -88,7 +88,7 @@ int list_lar(int argc, char *argv[])
printf(" %s ", walk + sizeof(struct lar_header));
printf("(%d bytes @0x%x)\n", ntohl(header->len),
printf("(%d bytes @0x%lx)\n", ntohl(header->len),
(walk - inmap) + ntohl(header->offset));
}