{
return (void *)NULL;
}
+
int
bfd_0(ignore)
bfd *ignore;
{
return 0;
}
+
unsigned int
bfd_0u(ignore)
bfd *ignore;
zalloc (size)
size_t size;
{
- char *ptr = malloc (size);
+ char *ptr = (char *) malloc (size);
if ((ptr != NULL) && (size != 0))
- bzero (ptr, size);
+ memset(ptr,0, size);
return ptr;
}
size_t
bfd_read (ptr, size, nitems, abfd)
- void *ptr;
+ PTR ptr;
size_t size;
size_t nitems;
bfd *abfd;
size_t
bfd_write (ptr, size, nitems, abfd)
- void *ptr;
+ PTR ptr;
size_t size;
size_t nitems;
bfd *abfd;
{
- return fwrite (ptr, 1, size*nitems, bfd_cache_lookup(abfd));
+ return fwrite (ptr, 1, size*nitems, bfd_cache_lookup(abfd));
}
int
bfd_seek (abfd, position, direction)
-bfd *abfd;
-file_ptr position;
-int direction;
+bfd * CONST abfd;
+CONST file_ptr position;
+CONST int direction;
{
/* For the time being, a bfd may not seek to it's end. The
problem is that we don't easily have a way to recognize